Abstract
We show that the support of minimum Lee weight codewords having Hamming weight 5 in the Preparata code over Z_4 form a 3-(2^m,5,10) design for any odd integer m \geq 3.
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.
