Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
From MaRDI portal
Publication:2383997
DOI10.1007/s10623-006-9032-7zbMath1148.94015OpenAlexW2076095404MaRDI QIDQ2383997
Dongvu Tonien, Reihaneh Safavi-Naini
Publication date: 20 September 2007
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-006-9032-7
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Existence of perfect 4-deletion-correcting codes with length six
- Existence of perfect 3-deletion-correcting codes
- On the construction of perfect deletion-correcting codes using design theory
- Traitor Tracing for Shortened and Corrupted Fingerprints
- Synchronization and substitution error-correcting codes for the Levenshtein metric
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Reliable communication over channels with insertions, deletions, and substitutions
- Codes correcting a single insertion/deletion of a zero or a single peak-shift
- Some general results of coding theory with applications to the study of codes for the correction of synchronization errors
- A combinatorial construction for perfect deletion-correcting codes
