Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Relationships between different error-correcting capabilities of a code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Konstantinidis, S. ; Dept. of Math. & Comput. Sci., St. Mary''s Univ., Halifax, NS, Canada

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

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 5 )