Cart (Loading....) | Create Account
Close category search window
 

Information-theoretic bounds on trellis complexity of nonlinear 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

2 Author(s)
Reuven, I. ; Dept. of Electr. Eng., Tel Aviv Univ., Israel ; Be'ery, Y.

Information-theoretic measures are used to derive both upper and lower bounds on the state complexity and on the branch complexity of nonlinear block codes To the best of our knowledge, the proposed upper bounds are the only upper bounds that address nonlinear codes. The improvement of the novel lower bounds is twofold: these bounds are tighter than the existing bounds and they also bound the trellis complexity of improper and unobservable trellis diagrams, unlike the existing bounds

Published in:

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

Date of Conference:

29 Jun-4 Jul 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.