  This paper presents general bounds on the highest achievable rate for
list-decodable insertion-deletion codes. In particular, we give novel outer and
inner bounds for the highest achievable communication rate of any
insertion-deletion code that can be list-decoded from any $\gamma$ fraction of
insertions and any $\delta$ fraction of deletions. Our bounds simultaneously
generalize the known bounds for the previously studied special cases of
insertion-only, deletion-only, and zero-rate and correct other bounds that had
been reported for the general case.
