Constant-List Insertion--Deletion Codes:New Bounds and an Improvement of Levenshtein's Lower Bound

Han Mao Kiah, Hengjia Wei, Ruixiao Zeng

We study codes correcting adversarial insertions and deletions with list size $L$ fixed independently of the block length. We derive new achievable-rate bounds for binary codes and…