Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$

DOI10.1109/TIT.2006.878237zbMath1309.94186OpenAlexW2157150798MaRDI QIDQ3548101

Jianxing Yin, Jian Min 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)

Related Items (7)

Existence of directed bibds with block size 7 and related perfect 5-deletion-correcting codes of length 7 ⋮ Spectrum of sizes for perfect 2-deletion-correcting codes of length 4 ⋮ 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 ⋮ 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: Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$