Nonbinary codes, correcting single deletion or insertion (Corresp.)

DOI10.1109/TIT.1984.1056962zbMath0554.94013OpenAlexW2081354249MaRDI QIDQ3218062

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

zbMATH Keywords

bursts of insertions or deletions

Mathematics Subject Classification ID

Burst-correcting codes (94B20)

Related Items (10)

Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs ⋮ On the construction of perfect deletion-correcting codes using design theory ⋮ On the Varshamov-Tenengolts construction on binary strings ⋮ Insdel codes from subspace and rank-metric codes ⋮ Constructions and decoding of GC-balanced codes for edit errors ⋮ On DNA codes ⋮ DNA codes for nonadditive stem similarity ⋮ On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability ⋮ Too many hats ⋮ An algebra of discrete channels that involve combinations of three basic error types

This page was built for publication: Nonbinary codes, correcting single deletion or insertion (Corresp.)