An algebra of discrete channels that involve combinations of three basic error types
From MaRDI portal
Publication:1854434
DOI10.1006/inco.2001.3035zbMath1014.94545OpenAlexW2044323336MaRDI QIDQ1854434
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0daebcf643db69fe147861a857571551de39580e
Related Items (6)
Synchronization ⋮ Descriptional Complexity of Error Detection ⋮ OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS ⋮ Dependences related to strict binary relations ⋮ Theoretical and implementational aspects of the formal language server (LaSer) ⋮ Error-detecting properties of languages
Cites Work
- Decoders with initial state invariance for multivalued encodings
- Structure of decoders for multivalued encodings
- Nonbinary codes, correcting single deletion or insertion (Corresp.)
- A decision procedure for the unique decipherability of multivalued encodings (Corresp.)
- A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
- Lee-metric BCH codes and their application to constrained and partial-response channels
- Error correction for channels with substitutions, insertions, and deletions
- Variable-length codes for error correction
- Structural analysis of error-correcting codes for discrete channels that involve combinations of three basic error types
- Construction of fixed-length insertion/deletion correcting runlength-limited codes
- Near-optimal, single-synchronization-error-correcting code
- A family of codes for the correction of substitution and synchronization errors
- Generalization of tests for certain properties of variable-length codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algebra of discrete channels that involve combinations of three basic error types
