Upper bounds on trellis complexity of lattices
- 1 July 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 43 (4) , 1294-1300
- https://doi.org/10.1109/18.605598
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Sequential decoding of lattice codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Proof of a conjecture of McEliece regarding the expansion index of the minimal trellisIEEE Transactions on Information Theory, 1996
- Trellis complexity versus the coding gain of lattices. IIIEEE Transactions on Information Theory, 1996
- Trellis complexity versus the coding gain of lattices. IIEEE Transactions on Information Theory, 1996
- Low-dimensional lattices V. Integral coordinates for integral latticesProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1989
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Sphere Packings, Lattices and GroupsPublished by Springer Nature ,1988
- Conjectured Diophantine Estimates on Elliptic CurvesPublished by Springer Nature ,1983
- Definite quadratische formen der dimension 24 und diskriminante 1Journal of Number Theory, 1973
- The viterbi algorithmProceedings of the IEEE, 1973