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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
