On the Varshamov-Tenengolts construction on binary strings

DOI10.1016/j.disc.2013.11.003zbMath1279.05050OpenAlexW2076511919MaRDI QIDQ393366

Negar Kiyavash, Ankur A. Kulkarni, Ramavarapu S. Sreenivas

Publication date: 17 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.11.003

zbMATH Keywords

hypergraphscoding theorydeletion channelsingle-deletion-correcting codesVarshamov-Tenengolts codes

Mathematics Subject Classification ID

Hypergraphs (05C65) Other types of codes (94B60)

Related Items (1)

Construction of single-deletion-correcting DNA codes using CIS codes

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted Composition Deletion Correcting Codes
• Nonbinary codes, correcting single deletion or insertion (Corresp.)
• Asymptotically good codes correcting insertions, deletions, and transpositions
• On multiple insertion/deletion correcting codes
• On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction
• Nonasymptotic Upper Bounds for Deletion Correcting Codes
• A class of codes for asymmetric channels and a problem from the additive theory of numbers
• Efficient reconstruction of sequences from their subsequences of supersequences

This page was built for publication: On the Varshamov-Tenengolts construction on binary strings