On the Varshamov-Tenengolts construction on binary strings

DOI10.1016/J.DISC.2013.11.003MaRDI QIDQ393366zbMATH OpenOpenAlexFDO

Authors Ankur A. Kulkarni, Negar Kiyavash, R. 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)

Recommendations

• Constructive enumeration of bit strings
• Binary strings and the Jacobsthal numbers
• A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
• Combinatorial version of the Slepian-Wolf coding theorem for binary strings
• On a Conjecture about Binary Strings Distribution
• On Varshamov-Tenengol'ts codes and a conjecture of L. A. Bassalygo
• Some generalizations on counting binary strings
• A note on ternary sequences of strings of 0 and 1
• A note on the number of N-bit strings with maximum complexity
• scientific article; zbMATH DE number 1336330

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 525969 (Why is no real title available?)
• scientific article; zbMATH DE number 1516705 (Why is no real title available?)
• scientific article; zbMATH DE number 1867238 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• scientific article; zbMATH DE number 3301965 (Why is no real title available?)
• A class of codes for asymmetric channels and a problem from the additive theory of numbers
• Asymptotically good codes correcting insertions, deletions, and transpositions
• Efficient reconstruction of sequences from their subsequences of supersequences
• Nonasymptotic Upper Bounds for Deletion Correcting Codes
• Nonbinary codes, correcting single deletion or insertion (Corresp.)
• On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction
• On multiple insertion/deletion correcting codes
• Restricted Composition Deletion Correcting Codes

Cited in

(1)

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

Describes a project that uses

Uses Software

• OEIS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393366)