DocumentCode
1162181
Title
Generalized Hamming weights of linear codes
Author
Helleseth, Tor ; Klove, Torleiv ; Ytrehus, Oyvind
Author_Institution
Dept. of Inf., Bergen Univ., Norway
Volume
38
Issue
3
fYear
1992
fDate
5/1/1992 12:00:00 AM
Firstpage
1133
Lastpage
1140
Abstract
The generalized Hamming weight, d r(C ), of a binary linear code C is the size of the smallest support of any r -dimensional subcode of C . The parameter d r(C ) determines the code´s performance on the wire-tap channel of Type II. Bounds on d r(C ), and in some cases exact expressions, are derived. In particular, a generalized Griesmer bound for d r(C ) is presented and examples are given of codes meeting this bound with equality
Keywords
error correction codes; binary codes; generalized Griesmer bound; generalized Hamming weight; linear codes; r-dimensional subcode; wire-tap channel; Binary codes; Cryptography; Decoding; Equations; Error correction codes; Hamming weight; Kernel; Linear code; Reed-Solomon codes; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.135655
Filename
135655
Link To Document