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

DOI10.1007/s10623-013-9848-xzbMath1351.94093OpenAlexW2087508684MaRDI QIDQ488256

Gennian Ge, Hengjia Wei

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

perfect codesoptimal codesgroup divisible designsdeletion-correcting codesdirected packings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence of perfect 4-deletion-correcting codes with length six
• Existence of \((v,K_{1(3)}\cup\{w^*\})\)-PBDs and its applications
• Some combinatorial constructions for optimal perfect deletion-correcting codes
• On small packing and covering designs with block size 4
• On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
• Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
• On the construction of perfect deletion-correcting codes using design theory
• Genomic Distances under Deletions and Insertions
• Spectrum of Sizes for Perfect Deletion-Correcting Codes
• Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$
• A combinatorial construction for perfect deletion-correcting codes

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