Trellis Complexity Versus the Coding Gain of Lattices I

Tarokh

Blake

I F

Resumen

No disponible

PÁGINAS

pp. 1796 - 1807

NÚMERO

Volumen: 42 Número: 6 (1) Parte: 0 (1996)

MATERIAS

INGENIERÍA Y CONSTRUCCIÓN CIVIL

REVISTAS SIMILARES

Artículos similares

CORRESPONDENCE - On the Trellis' Complexity of Root Lattices and Their Duals

Acceso

Ozeki, M; Solé, P; Banihashemi, A H; Blake, I F Pág. 2168 - 2172

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

CORRESPONDENCE - Constructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity

Acceso

Morelos-Zaragoza, R; Fujiwara, T; Kasami, T; Lin, S Pág. 725 - 730

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Early Detection and Trellis Splicing: Reduced-Complexity Iterative Decoding

Acceso

Frey, B J; Kschischang, F R Pág. 153 - 159

Revista: IEEE JOURNAL OF SELECTED AREAS IN COMMUNICATIONS

Trellis Complexity and Minimal Trellis Diagrams of Lattices

Acceso

Banihashemi, A H; Blake, I F Pág. 1829 - 1847

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes

Acceso

Reuven, I; Be'ery, Y Pág. 580 - 598

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Ver todas las revistas