Nonbinary codes, correcting single deletion or insertion (Corresp.)
From MaRDI portal
Publication:3218062
Recommendations
Cited in
(20)- 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
- scientific article; zbMATH DE number 605666 (Why is no real title available?)
- New dimension-independent upper bounds on linear insdel codes
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- Constructions and decoding of GC-balanced codes for edit errors
- scientific article; zbMATH DE number 3414190 (Why is no real title available?)
- Insdel codes from subspace and rank-metric codes
- Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs
- Nonbinary codes that correct symbol insertions, drop-outs, and substitutions
- Constructions of multi-permutation codes correcting a single burst of deletions
- Asymptotically good codes correcting insertions, deletions, and transpositions
- Real-time error correction codes for deletable errors
- DNA codes for nonadditive stem similarity
- On DNA codes
- Decoding algorithms of monotone codes and azinv codes and their unified view
- 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)