By Topic

On the second greedy weight for linear codes of dimension at least 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
$31 $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 ; Center of Inf. Security, Acad. of Math. & Syst. Sci., Beijing, China ; Klove, T.

The maximum of g2 - d2 for linear [n,k,d;q] codes C is studied. Here d2 is the smallest size of the support of a two-dimensional subcode of C and g2 is the smallest size of the support of a two-dimensional subcode of C which contains a codeword of weight d. For codes of dimension 4 or more, upper and lower bounds on the maximum of g2-d2 are given.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 2 )