Nonbinary codes, correcting single deletion or insertion (Corresp.)
From MaRDI portal
Publication:3218062
DOI10.1109/TIT.1984.1056962zbMATH Open0554.94013OpenAlexW2081354249MaRDI QIDQ3218062FDOQ3218062
Authors: Grigory Tenengolts 
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1984.1056962
Recommendations
Cited In (18)
- On the Varshamov-Tenengolts construction on binary strings
- Codes correcting a single insertion/deletion of a zero or a single peak-shift
- Too many hats
- An algebra of discrete channels that involve combinations of three basic error types
- Reliable communication over channels with insertions, deletions, and substitutions
- New dimension-independent upper bounds on linear insdel codes
- Title not available (Why is that?)
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- Constructions and decoding of GC-balanced codes for edit errors
- Title not available (Why is that?)
- Insdel codes from subspace and rank-metric codes
- Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs
- Asymptotically good codes correcting insertions, deletions, and transpositions
- Constructions of multi-permutation codes correcting a single burst of deletions
- Nonbinary codes that correct symbol insertions, drop-outs, and substitutions
- DNA codes for nonadditive stem similarity
- On DNA codes
- On the construction of perfect deletion-correcting codes using design theory
This page was built for publication: Nonbinary codes, correcting single deletion or insertion (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3218062)
