Trellis complexity versus the coding gain of lattices
Publication
, Conference
Tarokh, V; Blake, IF
Published in: IEEE International Symposium on Information Theory - Proceedings
January 1, 1995
The growth of trellis diagrams of lattices versus their coding gain is studied. It is established that this growth exponentially in terms of the coding gain.
Duke Scholars
Published In
IEEE International Symposium on Information Theory - Proceedings
Publication Date
January 1, 1995
Start / End Page
125
Citation
APA
Chicago
ICMJE
MLA
NLM
Tarokh, V., & Blake, I. F. (1995). Trellis complexity versus the coding gain of lattices. In IEEE International Symposium on Information Theory - Proceedings (p. 125).
Tarokh, V., and I. F. Blake. “Trellis complexity versus the coding gain of lattices.” In IEEE International Symposium on Information Theory - Proceedings, 125, 1995.
Tarokh V, Blake IF. Trellis complexity versus the coding gain of lattices. In: IEEE International Symposium on Information Theory - Proceedings. 1995. p. 125.
Tarokh, V., and I. F. Blake. “Trellis complexity versus the coding gain of lattices.” IEEE International Symposium on Information Theory - Proceedings, 1995, p. 125.
Tarokh V, Blake IF. Trellis complexity versus the coding gain of lattices. IEEE International Symposium on Information Theory - Proceedings. 1995. p. 125.
Published In
IEEE International Symposium on Information Theory - Proceedings
Publication Date
January 1, 1995
Start / End Page
125