Bounds for deletion/insertion correcting codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 370-

  Levenshtein, Vladimir I ^a  

^a KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CORRECTING CODES;

PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

CODES (SYMBOLS);

EID: 0036353452     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Bounds on the number of string subsequences
2. Binary codes capable of correcting deletions, insertions and reversals
3. Efficient reconstruction of sequences from their subsequenees or supersequences
4. Asymptotically good codes correcting insertions, deletions, and transpositions
5. The generalized Gilbert-Varshamov bound is implied by Turan's theorem