By Topic

Constructing critical indecomposable 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
$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

1 Author(s)
Walker, J.L. ; Dept. of Math. & Stat., Nebraska Univ., Lincoln, NE, USA

Critical indecomposable codes were introduced by Assmus (see ibid., vol.44, p.612-29, 1998), who also gave a recursive construction for these objects. One of the key ingredients in the construction is an auxiliary code, which is an indecomposable code of minimum distance at least 3. In terms of actually being able to construct all critical indecomposable codes, however, Assmus leaves many unanswered questions about these auxiliary codes. In this paper, we provide answers to these questions, including a description of when two equivalent auxiliary codes can yield inequivalent critical indecomposable codes, and results on both the minimum length and the maximum number of critical columns of an auxiliary code. We end with an enumeration of all critical indecomposable codes of dimension at most 10

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 5 )