Existence of perfect 3-deletion-correcting codes

DOI10.1023/A:1008212622423MaRDI QIDQ1379664zbMATH OpenOpenAlexFDO

Authors J. Ning

Publication date 25 February 1998

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

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

zbMATH Keywords

deletion-correcting codesdirected designdirected divisible design

Mathematics Subject Classification ID

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

Recommendations

• On perfect deletion-correcting codes
• Constructions for Perfect 5-Deletion-Correcting Codes of Length7
• A combinatorial construction for perfect deletion-correcting codes
• Constructions of perfect deletion-correcting codes of length \(\{3,4,5\}\)
• Some combinatorial constructions for optimal perfect deletion-correcting codes

Cited in

(13)

• Some combinatorial constructions for optimal perfect deletion-correcting codes
• A survey on maximum distance holey packings
• On the construction of perfect deletion-correcting codes using design theory
• Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
• The existence of the perfect deletion code with mixed length {4,5,6}
• Constructions for Perfect 5-Deletion-Correcting Codes of Length7
• A class of group divisible 3-designs and their applications
• On perfect deletion-correcting codes
• Existence of T^*(3, 4,v)‐codes
• Directed pairwise balanced designs with block sizes from subsets of \(\{3, 4, \dots , 10\}\) which contain 3
• Constructions of perfect deletion-correcting codes of length \(\{3,4,5\}\)
• A combinatorial construction for perfect deletion-correcting codes
• Existence of perfect 4-deletion-correcting codes with length six

This page was built for publication: Existence of perfect 3-deletion-correcting codes

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