Deletion-correcting codes and dominant vectors

zbMATH Open1488.94099arXiv1607.01233MaRDI QIDQ5155396FDOQ5155396

Authors: Emil Kolev 

Publication date: 6 October 2021

Abstract: In this paper we describe all pairs of binary vectors $$ such that the set of vectors obtained by $t$ deletions in $$ is a subset of the set of vectors obtained by $t$ deletions in $$ for $t=1,2$. Such pairs play an important role for finding the value of $L_2(n,t)$, the maximum cardinality of binary $t$-deletion-correcting code of length $n$.

Full work available at URL: https://arxiv.org/abs/1607.01233

Recommendations

• scientific article; zbMATH DE number 5302391
• scientific article; zbMATH DE number 1867238
• An improved bound on the fraction of correctable deletions
• Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
• scientific article; zbMATH DE number 3414190

zbMATH Keywords

Varshamov-Tenengolts codesinsertion/deletion codesmultiple insertion/deletion codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Cited In (5)

• A binary deletion channel with a fixed number of deletions
• Deletion correcting codes meet the Littlewood-Offord problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Applications of Gaussian binomials to coding theory for deletion error correction

This page was built for publication: Deletion-correcting codes and dominant vectors

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