Title :
A class of constant-weight cyclic codes
Author_Institution :
Link-AlVledia Devices Corp., Santa Clara, CA
Abstract :
In the paper, we identify a class of constant-weight cyclic codes. Specifically, we show that a well-known class of q-sary BCH codes excluding the all-zero codeword are constant-weight cyclic codes. Moreover, we show this class of codes achieve the Plotkin bound.
Keywords :
BCH codes; cyclic codes; Bose-Chaudhuri-Hocquenghem code; Plotkin bound; constant-weight cyclic code; q-sary BCH codes; Asynchronous communication; Hamming distance; Hamming weight; Multiaccess communication; Optical fibers; Polynomials;
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
DOI :
10.1109/ISIT.2008.4595372
