Existence of perfect 4-deletion-correcting codes with length six

DOI10.1023/A:1016562821812zbMath1012.94020OpenAlexW1500270341MaRDI QIDQ697639

Nabil Shalaby, Jianxing Yin, Jian Min Wang

Publication date: 17 September 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016562821812

zbMATH Keywords

perfect codesdirected group divisible quasidesignperfect deletion-correcting code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Related Items (5)

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

This page was built for publication: Existence of perfect 4-deletion-correcting codes with length six