Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Pagina's (van-tot) | 2034-2042 |
Tijdschrift | IEEE Transactions on Information Theory |
Volume | 42 |
Nummer van het tijdschrift | 6 |
DOI's | |
Status | Gepubliceerd - 1996 |