Codes for deletion and insertion channels with segmented errors

IEEE Transactions on Information Theory

Volumn 56, Issue 1, 2010, Pages 224-232

  Liu, Zhenming ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Deletion channels; Efficient codes; Insertion channels; Segmented errors; Timing errors

Indexed keywords

COMPLEX SCHEMES; COMPUTATIONALLY EFFICIENT; DISJOINT SEGMENTS; EFFICIENT CODES; ENCODING AND DECODING; TIMING ERRORS; WORST CASE;

TIME MEASUREMENT;

ERRORS;

EID: 73849088278     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2034886     Document Type: Article

References (17)

1. S. Butenko, P. Pardalos, I. Sergienko, V. Shylo, and P. Stetsyuk, "Finding maximum independent sets in graphs arising from coding theory," in Proc. 2002 ACM Symp. Appl. Comput., 2002, pp. 542-546.
2. L. Calabi and W. E. Hartnett, "A family of codes for the correction of substitution and synchronization errors," IEEE Trans. Inf. Theory, vol. 15, no. 1, pp. 102-106, 1969.
3. J. Chen, M. Mitzenmacher, C. Ng, and N. Varnica, "Concatenated codes for deletion channels," in Proc. IEEE Int. Symp. Information Theory, 2003, p. 218.
4. S. Diggavi and M. Grossglauser, "On information transmission over a finite buffer channel," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1226-1237, 2006.
5. S. Diggavi, M. Mitzenmacher, and H. Pfister, "Capacity upper bounds for deletion channels," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1716-1720.
6. R. G. Gallager, Sequential decoding for binary channels with noise and synchronization errors, Lincoln Labs., Lexington, MA, Oct. 1961, Group. Report.
7. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Physics-Doklady, vol. 10, no. 8, pp. 707-710, 1966, In Russian, Doklady Akademii Nauk SSR, vol. 163, no. 14, pp. 845-848.
8. M. C. Davey and D. J. C. MacKay, "Reliable communication over channels with insertions, deletions, and substitutions," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 687-698, 2001.
9. E. Drinea and M. Mitzenmacher, "On lower bounds for the capacity of deletion channels," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4648-4657, 2006.
10. H. C. Ferreira, W. A. Clarke, A. S. J. Helberg, K. A. S. Abdel-Ghaffar, and A. J. H. Vinck, "Insertion/deletion correction with spectral nulls," IEEE Trans. Inf. Theory, vol. 43, no. 2, pp. 722-732, 1997.
11. M. Mitzenmacher and E. Drinea, "A simple lower bound for the capacity of the deletion channel," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4657-4660, 2006.
12. E. Ratzer, "Marker codes for channels with insertions and deletions," Ann. Telecommun., vol. 60, no. 1-2, pp. 29-44, Jan.-Feb 2005.
13. N. J. A. Sloane, "On single-deletion-correcting codes," in Codes and Designs: Proc. Conf. Honoring Professor Dijen K. Ray-Chaudhuri on the Occasion of His 65th Birthday, Ohio State University, May 18-21, 2000, pp. 273-291.
14. N. Sloane, Challenge Problems: Independent Sets in Graphs [Online]. Available: http://www.research.att.com/~njas/doc/graphs.html.
15. R. R. Varshamov and G. M. Tenengolts, "Codes which correct single asymmetric errors (in Russian)," Automatika i Telemekhanika, vol. 26, no. 2, pp. 288-292, 1965, English translation in Automation and Remote Control, vol. 26, no. 2, pp. 286-290, 1965.
16. A. J. Van Wijngaarden, H. Morita, and A. J. H. Vinck, "Prefix synchronized codes capable of correcting single insertion/deletion errors," in Proc. Int. Symp. Inf. Theory, 1997, p. 409.
17. K. S. Zigangirov, "Sequential decoding for a binary channel with drop-outs and insertions," Probl. Inf. Transm., vol. 5, no. 2, pp. 17-22, 1969, Translated from Problemy Peredachi Informatsii, vol. 5, no.2, pp. 23-30, 1969.