Abstract
New bounds are given for the minimal Hamming and Lee weights of self-dual codes over Z4. For a self-dual code of length n, the Hamming weight is bounded above by 4[n/24]+f (n mod 24), for an explicitly given function f; the Lee weight is bounded above by 8[n/24]+g(n mod 24), for a different function g. These bounds appear to agree with the full linear programming bound for a wide range of lengths. The proof of these bounds relies on a reduction to a problem of binary codes, namely that of bounding the minimum dual distance of a doubly even binary code.
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.
