Title :
Trellis complexity versus the coding gain of lattices
Author :
Tarokh, Vahid ; Blake, I.F.
Author_Institution :
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
Abstract :
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
Keywords :
computational complexity; diagrams; encoding; coding gain; exponentially growth; lattices; trellis complexity; trellis diagrams; Block codes; Councils; Lattices; Viterbi algorithm;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.531329
