By Topic

A table of state complexity bounds for binary linear 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)
Schuurman, P. ; Dept. of Math., Eindhoven Univ. of Technol., Netherlands

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 )