DocumentCode :
1414640
Title :
On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two
Author :
Cheng, Jay ; Chao, Chi-chao
Author_Institution :
Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Volume :
43
Issue :
1
fYear :
1997
fDate :
1/1/1997 12:00:00 AM
Firstpage :
294
Lastpage :
298
Abstract :
The generalized Hamming weights introduced by Wei (1991) have been shown to be fundamental descriptive parameters of a linear block code. They have been found to be useful in certain cryptographic applications and in the studies of minimal trellis diagrams of linear block codes. In this correspondence, we determine the first few and the last few generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two, of their extensions, and of the duals of both
Keywords :
BCH codes; block codes; cryptography; dual codes; linear codes; binary primitive BCH codes; cryptographic applications; duals; generalized Hamming weights; linear block code; minimal trellis diagrams; minimum distance; Block codes; Code standards; Hamming weight; Parity check codes; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.567718
Filename :
567718
Link To Document :
بازگشت