Spectrum of sizes for perfect 2-deletion-correcting codes of length 4

DOI10.1007/S10623-013-9848-XMaRDI QIDQ488256zbMATHOpenAlexFDO

Authors Hengjia Wei, Gennian Ge

Publication date 23 January 2015

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

Full work available at URL https://doi.org/10.1007/s10623-013-9848-x

zbMATH Keywords

optimal codesperfect codesgroup divisible designsdeletion-correcting codesdirected packings

Mathematics Subject Classification ID

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

Recommendations

• Spectrum of sizes for perfect deletion-correcting codes
• Existence of perfect 4-deletion-correcting codes with length six
• Optimal Single Deletion Correcting Code of Length Four Over an Alphabet of Even Size
• Constructions of perfect deletion-correcting codes of length \(\{3,4,5\}\)
• Some combinatorial constructions for optimal perfect deletion-correcting codes
• A combinatorial construction for perfect deletion-correcting codes
• Codes of length two correcting single errors of limited size. II
• scientific article; zbMATH DE number 6900655
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• On Optimal k-Deletion Correcting Codes

Cites work

• scientific article; zbMATH DE number 4211968 (Why is no real title available?)
• scientific article; zbMATH DE number 3896945 (Why is no real title available?)
• scientific article; zbMATH DE number 46208 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• A combinatorial construction for perfect deletion-correcting codes
• Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$
• Existence of \((v,K_{1(3)}\cup\{w^*\})\)-PBDs and its applications
• Existence of perfect 4-deletion-correcting codes with length six
• Genomic distances under deletions and insertions
• Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
• On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
• On small packing and covering designs with block size 4
• On the construction of perfect deletion-correcting codes using design theory
• Some combinatorial constructions for optimal perfect deletion-correcting codes
• Spectrum of sizes for perfect deletion-correcting codes

Cited in

(1)

• Spectrum of sizes for perfect deletion-correcting codes

This page was built for publication: Spectrum of sizes for perfect 2-deletion-correcting codes of length 4

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