In this paper, we present an explicit construction of list-decodable codes for single-deletion and single-substitution with list size two and redundancy 3log n+4, where n is the block length of the code. Our construction has lower redundancy than the best known explicit construction by Gabrys et al. (arXiv 2021), whose redundancy is 4log n+O(1).

翻译：在本文中,我们明确提出了单删除和单替代单删除和单替换列表可变代码的明确结构,其尺寸为二,冗余为3log n+4,其中n是代码的区块长度。我们的构建的冗余低于Gabrys等人(arXiv 2021)最著名的明确构建的冗余,后者的冗余为4log n+O(1)。