An algorithmic approach for finding deletion correcting codes

2011 IEEE Information Theory Workshop, ITW 2011

Volumn , Issue , 2011, Pages 25-29

  Khajouei, Farzaneh ^a   Zolghadr, Mahdy ^b   Kiyavash, Negar ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC APPROACH; CARDINALITIES; CODEBOOKS; CORRECTING CODES; DELETION-CORRECTING; LOWER BOUNDS; MAXIMAL INDEPENDENT SET ALGORITHMS;

HEURISTIC ALGORITHMS;

CODES (SYMBOLS);

EID: 83655193057     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2011.6089432     Document Type: Conference Paper

References (12)

1. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Physics - Doklady, vol. 10, no. 8, pp. 707-710, February 1966.
2. F. McWilliams and N. Sloane, The Theory of Error Correcting Codes, Amsterdam, The Netherland, North Holland, 1977.
3. J. D. Ullman, "On the capabilities of codes to correct synchronization errors," IEEE Trans. Inf. Theory, vol. IT-13, no. 1, pp. 95-105, January 1967.
4. N. Sloane, "On single-deletion-correcting codes," Codes and Designs, Ohio State University, pp. 273-292, May 2002.
5. T. Swart and H. Ferreira, "A note on double insertion/deletion correcting codes," IEEE Transaction on Information Theory, vol. 49, no. 1, pp. 269-273, 2003.
6. Z. Liu and M. Mitzenmacher, "Codes for deletion and insertion channels with segmented errors," IEEE Transactions on Information Theory, vol. 56, no. 1, Jan. 2010.
7. N. Sloane.," Challenge problems: Independent sets in graphs http://www2.research.att.com/njas/doc/graphs.html"
8. D. J. M. R. Gary, Computers and interactability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
9. R. R. Varshamov, "On an arithmetic function with an application in the theory of coding," no. 3, pp. 540-543, 1965.
10. A. S. J. Helberg and H. C. Ferreira, "On multiple insertion/deletion correcting codes," IEEE Trans. Inform. Theory, vol. 48, pp. 305-308, January 2002.
11. S. Butenko, P. Pardalos, I. Sergienko, V. Shylo, and P. Stetsyuk., "Finding maximum independent sets in graphs arising from coding theory," Proceedings of the 2002 ACM Symposium on Applied Computing, pp. 542-546, 2002.
12. R. L. R. Thomas H. Cormen, Charles E. Leiserson, Introduction to algorithms. MIT Press/McGraw-Hill., 1990.