Relationships between different error-correcting capabilities of a code

DOI10.1109/18.930944MaRDI QIDQ4544649zbMATH OpenOpenAlexFDO

Authors Stavros Konstantinidis

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.930944

zbMATH Keywords

error-correcting codessynchronization errorsSID channelsdiscrete channelsLevenshtein distances

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• An algebra of discrete channels that involve combinations of three basic error types
• Some general results of coding theory with applications to the study of codes for the correction of synchronization errors
• A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
• Error correction for channels with substitutions, insertions, and deletions
• Structural analysis of error-correcting codes for discrete channels that involve combinations of three basic error types

Cited in

(3)

• An algebra of discrete channels that involve combinations of three basic error types
• Language equations, maximality and error-detection
• A Comparison of Some Error Detecting CRC Code Standards

This page was built for publication: Relationships between different error-correcting capabilities of a code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544649)