Tight Bounds on the Minimum Average Weight per Branch for Rate (N - 1)/N Convolutional Codes

Hole

M F

Hole

K J

Resumen

No disponible

PÁGINAS

pp. 1301 - 1304

NÚMERO

Volumen: 43 Número: 4 Parte: 0 (1997)

MATERIAS

INGENIERÍA Y CONSTRUCCIÓN CIVIL

REVISTAS SIMILARES

Artículos similares

Simple Tight Upper Bounds for Average SEP and BEP of Coherent Diversity M-ary Biorthogonal Signals Over Fading Channels

Acceso

Radaydeh, R.M. Pág. 2816 - 2820

Revista: IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY

Tight Bounds for Critical Sections in Processor Consistent Platforms

Acceso

Higham, L.; Kawash, J. Pág. 1072 - 1083

Revista: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

Tight Bounds for Testing Bipartiteness in General Graphs

Acceso

Tali Kaufman, Michael Krivelevich, Dana Ron Pág. 1417 - 1440

Revista: SIAM JOURNAL ON COMPUTING

On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation

Acceso

Fernandez, E. Meza, O. Garfinkel, R. Ortega, M. Pág. 281 - 291

Revista: OPERATIONS RESEARCH

CORRESPONDENCE - Tight Error Bounds for Nonuniform Signaling over AWGN Channels

Acceso

Kuai, H; Alajaji, F; Takahara, G Pág. 2712 - 2717

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Ver todas las revistas