Scholars@Duke

Trellis complexity versus the coding gain of lattices II

Publication ,  Journal Article
Tarokh, V; Blake, LF
Published in: IEEE Transactions on Information Theory
December 1, 1996
Published version (DOI)

For an arbitrary rational lattice L with gain γ, the average number of states (respectively, branches) in any given trellis diagram of L is bounded below by a function of γ. It is proved that this function grows exponentially in γ. In the reverse direction, it is proved that given e > 0, for arbitrarily large values of γ, there exist lattices of gain γ with an average number of branches and states less than exp (7 ). © 1996 IEEE.

Duke Scholars

Vahid Tarokh
Author Vahid Tarokh Electrical and Computer Engineering

Published In

IEEE Transactions on Information Theory

DOI

10.1109/18.556676

ISSN

0018-9448

Publication Date

December 1, 1996

Volume

42

Issue

6 PART 1

Start / End Page

1808 / 1816

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Tarokh, V., & Blake, L. F. (1996). Trellis complexity versus the coding gain of lattices II. IEEE Transactions on Information Theory, 42(6 PART 1), 1808–1816. https://doi.org/10.1109/18.556676
Tarokh, V., and L. F. Blake. “Trellis complexity versus the coding gain of lattices II.” IEEE Transactions on Information Theory 42, no. 6 PART 1 (December 1, 1996): 1808–16. https://doi.org/10.1109/18.556676.
Tarokh V, Blake LF. Trellis complexity versus the coding gain of lattices II. IEEE Transactions on Information Theory. 1996 Dec 1;42(6 PART 1):1808–16.
Tarokh, V., and L. F. Blake. “Trellis complexity versus the coding gain of lattices II.” IEEE Transactions on Information Theory, vol. 42, no. 6 PART 1, Dec. 1996, pp. 1808–16. Scopus, doi:10.1109/18.556676.
Tarokh V, Blake LF. Trellis complexity versus the coding gain of lattices II. IEEE Transactions on Information Theory. 1996 Dec 1;42(6 PART 1):1808–1816.

Published In

IEEE Transactions on Information Theory

DOI

10.1109/18.556676

ISSN

0018-9448

Publication Date

December 1, 1996

Volume

42

Issue

6 PART 1

Start / End Page

1808 / 1816

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing