Existence of perfect 3-deletion-correcting codes

DOI10.1023/A:1008212622423zbMath0903.94051OpenAlexW1572473735MaRDI QIDQ1379664

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)

Related Items (5)

A survey on maximum distance holey packings ⋮ Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes ⋮ 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: Existence of perfect 3-deletion-correcting codes