Constructions for Perfect 5-Deletion-Correcting Codes of Length7

DOI10.1109/TIT.2006.878237MaRDI QIDQ3548101zbMATH OpenOpenAlexFDO

Authors Jianxing Yin, Jianmin Wang

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2006.878237

Mathematics Subject Classification ID

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

Recommendations

• A combinatorial construction for perfect deletion-correcting codes
• Some combinatorial constructions for optimal perfect deletion-correcting codes
• Constructions of perfect deletion-correcting codes of length \(\{3,4,5\}\)
• Existence of perfect 3-deletion-correcting codes
• The existence of the perfect deletion code with mixed length {4,5,6}

Cited in

(12)

• Super-simple, pan-orientable and pan-decomposable GDDs with block size 4
• Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures
• On perfect deletion-correcting codes
• Existence of directed bibds with block size 7 and related perfect 5-deletion-correcting codes of length 7
• Directed pairwise balanced designs with block sizes from subsets of \(\{3, 4, \dots , 10\}\) which contain 3
• A class of group divisible 3-designs and their applications
• Spectrum of sizes for perfect 2-deletion-correcting codes of length 4
• Existence of perfect 4-deletion-correcting codes with length six
• A combinatorial construction for perfect deletion-correcting codes
• Some combinatorial constructions for optimal perfect deletion-correcting codes
• On the construction of perfect deletion-correcting codes using design theory
• Constructions of perfect deletion-correcting codes of length \(\{3,4,5\}\)

This page was built for publication: Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$

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