A combinatorial construction for perfect deletion-correcting codes
From MaRDI portal
Publication:5939681
DOI10.1023/A:1011271920403zbMath1022.94023OpenAlexW1503873412MaRDI QIDQ5939681
Publication date: 21 October 2003
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011271920403
Related Items
A survey on maximum distance holey packings ⋮ Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes ⋮ Spectrum of sizes for perfect 2-deletion-correcting codes of length 4 ⋮ DIRECTED PAIRWISE BALANCED DESIGNS WITH BLOCK SIZES FROM SUBSETS OF {3, 4, …, 10} WHICH CONTAIN 3 ⋮ A class of group divisible 3-designs and their applications ⋮ Some combinatorial constructions for optimal perfect deletion-correcting codes