Title :
A table of state complexity bounds for binary linear codes
Author :
Schuurman, Petra
Author_Institution :
Dept. of Math., Eindhoven Univ. of Technol., Netherlands
fDate :
11/1/1996 12:00:00 AM
Abstract :
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
Keywords :
binary sequences; block codes; computational complexity; linear codes; matrix algebra; binary linear codes; generator matrix; low dimension codes; low minimum distance codes; state complexity bounds; table; Block codes; Decoding; Hamming distance; Linear code; Mathematics; State-space methods; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
