Autor:	Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov
Rok vydání:	2007
Předmět:	Discrete mathematics Block code Trellis (graph) Library and Information Sciences Linear code Computer Science Applications Combinatorics State complexity Convolutional code Tornado code Binary code Binary linear codes Information Systems Mathematics
Zdroj:	IEEE Transactions on Information Theory. 53:361-368
ISSN:	0018-9448
DOI:	10.1109/tit.2006.887522
Popis:	An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lower and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) construction
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::02ad4a49718a55935ac6a8a0e10e1e0c https://doi.org/10.1109/tit.2006.887522 Zobrazit plný text záznamu