Some combinatorial constructions for optimal perfect deletion-correcting codes
From MaRDI portal
Publication:1009053
DOI10.1007/s10623-008-9212-8zbMath1178.94256OpenAlexW1967151799MaRDI QIDQ1009053
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9212-8
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Existence of perfect 4-deletion-correcting codes with length six
- On the existence of frames
- Balanced incomplete block designs and related designs
- Group divisible designs with block-size four
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Existence of perfect 3-deletion-correcting codes
- Every twofold triple system can be directed
- On the construction of perfect deletion-correcting codes using design theory
- Directed packings with block size 5 and even \(v\)
- Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$
- Constructions of optimal packing designs
- Existence of directed GDDs with block size five
- On perfect deletion-correcting codes
- Existence of T*(3, 4,v)‐codes
- A combinatorial construction for perfect deletion-correcting codes
- Directed packing and covering designs with block size four
This page was built for publication: Some combinatorial constructions for optimal perfect deletion-correcting codes
