Relationships between different error-correcting capabilities of a code

Authors:
S. Konstantinidis
Affiliations:
Dept. of Math. & Comput. Sci., St. Mary's Univ., Halifax, NS
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

Language equations, maximality and error-detection

Journal of Computer and System Sciences
Block Substitutions and Their Properties

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Block Substitutions and Their Properties

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Automata for codes

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	754.84

Visualization

Abstract

SID channels are discrete channels represented by expressions that involve combinations of the error types substitution, insertion, and deletion. In this correspondence, a simple distance is defined that generalizes the Hamming and Levenshtein distances. For a certain class of SID channels, the distance is used to obtain a necessary and sufficient condition for the error-correcting capability that corresponds to the channel in question. Moreover, it is shown that for many SID channels whose expressions include the insertion type, their error-correcting codes coincide with those for SID channels whose expressions result by replacing the insertion type with the deletion type