List-decodable Codes for Single-deletion Single-substitution with List-size Two
Information Theory
2022-01-27 v2 math.IT
Abstract
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).
Cite
@article{arxiv.2201.02013,
title = {List-decodable Codes for Single-deletion Single-substitution with List-size Two},
author = {Wentu Song and Kui Cai and Tuan Thanh Nguyen},
journal= {arXiv preprint arXiv:2201.02013},
year = {2022}
}