By Topic

Weight hierarchies of linear codes satisfying the almost chain condition

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 ; Lab. of Syst. & Control, Acad. Sinica, Beijing, China ; Klove, T.

The difference sequence (DS) of a linear code is defined. The difference sequence can easily be computed from the weight hierarchy and vice versa. The authors determine an almost chain difference sequence (ACDS). The main result is that almost all almost chain-permissible sequences are ACDS.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002