Abstract
Nguyen, Gyorfi and Massey (see IEEE Trans. Inform. Theory, vo1.38, no.3, p.940-9, 1992) presented a new construction method for binary constant-weight cyclic codes. By slightly modifying this method, we could construct new constant-weight codes (not necessarily cyclic). Furthermore, two classes of binary optimum constant-weight codes could be constructed by using this modified method. In general, we show that binary optimum constant-weight codes, which achieve the Johnson bound, could be constructed from codes over GF(q) which achieve the Plotkin bound.
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
