Abstract
In this note, we prove that if C is a duadic binary abelian code with splitting μ= μ −1 and the minimum odd weight of C satisfies d 2− d+1≠ n, then d( d−1)⩾ n+11. We show by an example that this bound is sharp. A series of open problems on this subject are proposed.
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.
