Non-Binary Diameter Perfect Constant-Weight Codes

DOI10.1109/TIT.2021.3125277zbMATH Open1489.94198arXiv2109.00613OpenAlexW3208389924MaRDI QIDQ5030331FDOQ5030331

Publication date: 17 February 2022

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

Abstract: Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it holds for some other metrics too. In this paper we prove the bound for non-binary constant-weight codes with the Hamming metric and characterize the diameter perfect codes and the maximum size anticodes for these codes. We distinguish between six families of non-binary diameter constant-weight codes and four families of maximum size non-binary constant-weight anticodes. Each one of these families of diameter perfect codes raises some different questions. We consider some of these questions and leave lot of ground for further research. Finally, as a consequence, some t-intersecting families related to the well-known Erd"{o}s-Ko-Rado theorem, are constructed.

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

Recommendations

zbMATH Keywords

intersecting families Hamming metric diameter perfect codes Erdős-Ko-Rado theorem bound for non-binary constant-weight codes maximum size anticodes

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Cited In (1)

A family of diameter perfect constant-weight codes from Steiner systems

This page was built for publication: Non-Binary Diameter Perfect Constant-Weight Codes

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