DocumentCode
2725475
Title
Two classes of binary optimum constant-weight codes
Author
Fu, Fang-Wei ; Shen, Shi-Yi
Author_Institution
Dept. of Math., Nankai Univ., Tianjin, China
fYear
1995
fDate
17-22 Sep 1995
Firstpage
238
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
Keywords
Galois fields; binary sequences; cyclic codes; Galois field; Johnson bound; Plotkin bound; binary constant-weight cyclic codes; binary optimum constant-weight codes; Error correction; Error correction codes; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.535753
Filename
535753
Link To Document