In the random deletion channel, each bit is deleted independently with probability p. For the random deletion channel, the existence of codes of rate (1-p)/9, and thus bounded away from 0 for any p < 1, has been known. We give an explicit construction with polynomial time encoding and deletion correction algorithms with rate c_0 (1-p) for an absolute constant c_0 > 0.
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2017.47, author = {Guruswami, Venkatesan and Li, Ray}, title = {{Efficiently Decodable Codes for the Binary Deletion Channel}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {47:1--47:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.47}, URN = {urn:nbn:de:0030-drops-75964}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.47}, annote = {Keywords: Coding theory, Combinatorics, Synchronization errors, Channel capacity} }
Feedback for Dagstuhl Publishing