Abstract
The concept of diameter perfect codes, which seems to be a natural generalization of perfect codes (codes attaining the sphere–packing bound) is introduced. This was motivated by the ``code–anticode'' bound of Delsarte in distance regular graphs. This bound in conjunction with the recent complete solutions of diametric problems in the Hamming graph \H_q(n) and the Johnson graph J(n,k) gives a sharpening of the sphere–packing bound. Some necessary conditions for the existence of diameter perfect codes are given. In the Hamming graph all diameter perfect codes over alphabets of prime power size are characterized. The problem of tiling of the vertex set of J(n,k) with caps (and maximal anticodes) is also examined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
