On Multifold Packings of Radius-1 Balls in Hamming Graphs

DOI10.1109/TIT.2020.3046260zbMath1473.94140arXiv1902.00023OpenAlexW2914368414MaRDI QIDQ5001741

Vladimir N. Potapov, Denis S. Krotov

Publication date: 23 July 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.00023

zbMATH Keywords

asymptotic bounds for maximum sizeoptimal binary 2-fold 1-packings

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Perfect 2‐colorings of Hamming graphs ⋮ The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes

This page was built for publication: On Multifold Packings of Radius-1 Balls in Hamming Graphs