Abstract
We give another proof of Lloyd's theorem using homogeneous distance enumerators, and show that the same techniques will give similar theorems for more general types of codes. The theorem has been proved earlier by Delsarte and Lenstra. We thought it interesting that the result can be derived from some elementary polynomial manipulations. The methods and results herein should be considered as belonging to combinatorial coding theory, since it is not necessary to use the finite field approach to get them.
Sign-in/Register to access full text options 
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.
