Abstract
The theory of higher weights is applied to binary self-dual codes. Bounds are given for the second minimum higher weight and a Gleason-type theorem is derived for the second higher weight enumerator. The second weight enumerator is shown to be unique for the putative [72,36,16] Type II code and the first three minimum weights are computed for optimal codes of length less than 32. We also determine the structures of the graded rings associated with the code polynomials of higher weights for small genera, one of which has the property that it is not Cohen–Macaulay.
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.
