DocumentCode :
924917
Title :
Synchronization and substitution error-correcting codes for the Levenshtein metric
Author :
Tanaka, Eiichi ; Kasai, Tamotsu
Volume :
22
Issue :
2
fYear :
1976
fDate :
3/1/1976 12:00:00 AM
Firstpage :
156
Lastpage :
162
Abstract :
Block codes are constructed that are capable of simultaneously correcting 
or fewer synchronization errors in 
consecutive words, for any 
, and 
or fewer substitution errors in eachof 
or fewer of these words under the condition that there exists at least one ungarbled word among the consecutive words. Also, some new extensions of the 
codes of Calabi and Hartnett are presented under the condition that synchronization and substitution errors do not coexist in the consecutive words.
or fewer synchronization errors in consecutive words, for any , and or fewer substitution errors in eachof or fewer of these words under the condition that there exists at least one ungarbled word among the consecutive words. Also, some new extensions of the codes of Calabi and Hartnett are presented under the condition that synchronization and substitution errors do not coexist in the consecutive words.Keywords :
Block codes; Error-correcting codes; Binary codes; Block codes; Decoding; Error correction; Error correction codes; Length measurement; Sufficient conditions;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1976.1055532
Filename :
1055532
Link To Document :
