By Topic

Bounds on the weight hierarchies of linear codes of dimension 4

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

2 Author(s)
Wende Chen ; Inst. of Syst. Sci., Acad. Sinica, Beijing, China ; Klove, T.

The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,…,dk) where d r is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes. For each class bounds and extremal codes are discussed

Published in:

Information Theory, IEEE Transactions on  (Volume:43 ,  Issue: 6 )