Referenced Items are not available for this document.
This article contains a table of bounds on the state complexity of binary linear codes with length smaller than 25. General results on the state complexity of binary linear codes with low dimension or low minimum distance are included
Published in:
Information Theory, IEEE Transactions on
(Volume:42
,
Issue:
6
)
Date of Publication: Nov 1996
- Page(s):
- 2034 - 2042
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 5492771
- Digital Object Identifier :
- 10.1109/18.556700
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Nov 1996
- Sponsored by :
- IEEE Information Theory Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
