Block codes are constructed that are capable of simultaneously correcting e or fewer synchronization errors in t consecutive words, for any t geq 2e + 1, and s or fewer substitution errors in eachof t - 1 or fewer of these words under the condition that there exists at least one ungarbled word among the t consecutive words. Also, some new extensions of the A_n^c codes of Calabi and Hartnett are presented under the condition that synchronization and substitution errors do not coexist in the t consecutive words.
Description
Welcome to IEEE Xplore 2.0: Synchronization and substitution error-correcting codes for the Levenshtein metric
%0 Journal Article
%1 Tanaka1976
%A Tanaka, E.
%A Kasai, T.
%B Information Theory, IEEE Transactions on
%D 1976
%K B_scanpathsimilarity informationtheory
%P 156- 162
%T Synchronization and substitution error-correcting codes for the Levenshtein metric
%U http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1055532
%V 22
%X Block codes are constructed that are capable of simultaneously correcting e or fewer synchronization errors in t consecutive words, for any t geq 2e + 1, and s or fewer substitution errors in eachof t - 1 or fewer of these words under the condition that there exists at least one ungarbled word among the t consecutive words. Also, some new extensions of the A_n^c codes of Calabi and Hartnett are presented under the condition that synchronization and substitution errors do not coexist in the t consecutive words.
@article{Tanaka1976,
abstract = {Block codes are constructed that are capable of simultaneously correcting e or fewer synchronization errors in t consecutive words, for any t geq 2e + 1, and s or fewer substitution errors in eachof t - 1 or fewer of these words under the condition that there exists at least one ungarbled word among the t consecutive words. Also, some new extensions of the A_{n}^{c} codes of Calabi and Hartnett are presented under the condition that synchronization and substitution errors do not coexist in the t consecutive words.},
added-at = {2007-10-03T16:40:31.000+0200},
author = {Tanaka, E. and Kasai, T.},
biburl = {https://www.bibsonomy.org/bibtex/24aa0a543df9ca30efe41216b4f27a3cd/tmalsburg},
booktitle = {Information Theory, IEEE Transactions on},
description = {Welcome to IEEE Xplore 2.0: Synchronization and substitution error-correcting codes for the Levenshtein metric},
interhash = {8f9ebc2ea068365508f3b50c5a1ed245},
intrahash = {4aa0a543df9ca30efe41216b4f27a3cd},
issn = {0018-9448},
keywords = {B_scanpathsimilarity informationtheory},
pages = {156- 162},
timestamp = {2007-10-04T14:16:02.000+0200},
title = {Synchronization and substitution error-correcting codes for the Levenshtein metric},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1055532},
volume = 22,
year = 1976
}