This paper studies the cardinality of codes correcting insertions and deletions. We give an asymptotically improved upper bound on code size. The bound is obtained by utilizing the asymmetric property of list decoding for insertions and deletions.

翻译：本文研究了校正插入和删除代码的守则的基本要素。我们对代码大小的上限进行了无时不刻式的改进。通过使用列表解码的不对称属性进行插入和删除来获得约束。