DocumentCode :
1254313
Title :
On the constructions of constant-weight codes
Author :
Fu, Fang-Wei ; Vinck, A. J Han ; Shen, Shi-Yi
Author_Institution :
Inst. of Exp. Math., Essen Univ., Germany
Volume :
44
Issue :
1
fYear :
1998
fDate :
1/1/1998 12:00:00 AM
Firstpage :
328
Lastpage :
333
Abstract :
Two methods of constructing binary constant-weight codes from (1) codes over GF(q) and (2) constant-weight codes over GF(q) are presented. Several classes of binary optimum constant-weight codes are derived from these methods. In general, we show that binary optimum constant-weight codes, which achieve the Johnson bound, can be constructed from optimum codes over GF(q) which achieve the Plotkin bound. Finally, several classes of optimum constant-weight codes over GF(q) are constructed
Keywords :
Galois fields; binary sequences; concatenated codes; GF(q); Johnson bound; Plotkin bound; binary constant-weight codes; concatenated construction; constant-weight codes; optimum constant-weight codes; Computer science; Conferences; Cryptography; Error correction; Error correction codes; Information theory; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.651060
Filename :
651060
Link To Document :
بازگشت