Multifold 1-perfect codes
From MaRDI portal
Publication:6584900
DOI10.1002/JCD.21947MaRDI QIDQ6584900
Publication date: 8 August 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
spreadscompletely regular codesperfect codesadditive codesmultiple coveringintriguing setslist-decoding codesmultifold packingmultispreads
Cites Work
- Intriguing sets of vertices of regular graphs
- A new distance-regular graph of diameter 3 on 1024 vertices
- The Geometry of Two-Weight Codes
- On Multifold Packings of Radius-1 Balls in Hamming Graphs
- On the Nonexistence of Perfect Codes over Finite Fields
- Perfect 2‐colorings of Hamming graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Multifold 1-perfect codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584900)