Abstract
For a given prime power q, a new method for constructing q-ary constant weight codes is presented, and then several classes of q-ary constant weight codes are given by using the trace map over finite fields. Especially, for q=2, some of these codes are optimal, and then the maximal possible sizes of two classes of binary constant weight codes are determined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.