By Topic

Generalized Hamming weights of linear codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
T. Helleseth ; Dept. of Inf., Bergen Univ., Norway ; T. Klove ; O. Ytrehus

The generalized Hamming weight, dr(C), of a binary linear code C is the size of the smallest support of any r-dimensional subcode of C. The parameter dr(C) determines the code's performance on the wire-tap channel of Type II. Bounds on dr(C), and in some cases exact expressions, are derived. In particular, a generalized Griesmer bound for dr(C) is presented and examples are given of codes meeting this bound with equality

Published in:

IEEE Transactions on Information Theory  (Volume:38 ,  Issue: 3 )