Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/tit/KasamiTFL93
%A Kasami, Tadao
%A Takata, Toyoo
%A Fujiwara, Toru
%A Lin, Shu
%D 1993
%J IEEE Trans. Inf. Theory
%K dblp
%N 1
%P 242-245
%T On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes.
%U http://dblp.uni-trier.de/db/journals/tit/tit39.html#KasamiTFL93
%V 39
@article{journals/tit/KasamiTFL93,
added-at = {2020-09-10T00:00:00.000+0200},
author = {Kasami, Tadao and Takata, Toyoo and Fujiwara, Toru and Lin, Shu},
biburl = {https://www.bibsonomy.org/bibtex/2e9c9a65ad3ebb55f1e74fddfc732fcd4/dblp},
ee = {https://doi.org/10.1109/18.179366},
interhash = {15199c7f20fbe3adebe767297d1b6adc},
intrahash = {e9c9a65ad3ebb55f1e74fddfc732fcd4},
journal = {IEEE Trans. Inf. Theory},
keywords = {dblp},
number = 1,
pages = {242-245},
timestamp = {2020-09-11T11:45:44.000+0200},
title = {On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes.},
url = {http://dblp.uni-trier.de/db/journals/tit/tit39.html#KasamiTFL93},
volume = 39,
year = 1993
}