Abstract
In [2], L. Chihara proved that many infinite families of classical distance-regular graphs have no nontrivial perfect codes, including the Grassman graphs and the bilinear forms graphs. Here, we present a new proof of her result for these two families using Delsarte's anticode condition[3]. The technique is an extension of an approach taken by C. Roos [6] in the study of perfect codes in the Johnson graphs.
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.
