By Topic

On trellis complexity of block codes: lower bounds

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)
Lafourcade-Jumenbo, A. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Vardy, A.

We present a new lower bound on the state-complexity of linear codes, which includes all the existing bounds as special cases. For a large number of codes this results in a considerable improvement upon the DLP bound. Moreover, we generalize the new bound to nonlinear codes, and introduce several alternative techniques for lower bounding the trellis complexity, based on the distance spectrum and other combinatorial properties of the code. We also show how our techniques may be employed to lower bound the maximum and the total number of branches in the trellis. The asymptotic behavior of the new bound is investigated and shown to improve upon the known asymptotic estimates of trellis complexity

Published in:

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

Date of Conference:

17-22 Sep 1995