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

Ozeki

Solé

Banihashemi

A H

Blake

I F

Resumen

No disponible

PÁGINAS

pp. 2168 - 2172

NÚMERO

Volumen: 45 Número: 6 Parte: 0 (1999)

MATERIAS

INGENIERÍA Y CONSTRUCCIÓN CIVIL

REVISTAS SIMILARES

Artículos similares

CORRESPONDENCE - Polynomial Complexity Optimal Detection of Certain Multiple-Access Systems

Acceso

Schlegel, C; Grant, A Pág. 2246 - 2248

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

CORRESPONDENCE - A Relationship Between Linear Complexity and k-Error Linear Complexity

Acceso

Kurosava, K; Sato, F; Sakata, T; Kishimoto, W Pág. 694

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

CORRESPONDENCE - Modeling - Reduced Complexity Modeling and Reproduction of Colored Textures

Acceso

Campisi, P; Neri, A; Scarano, G Pág. 510 - 517

Revista: IEEE TRANSACTIONS ON IMAGE PROCESSING

CORRESPONDENCE - A Fast Algorithm for Determining the Linear Complexity of a Sequence with Period pn Over GF (q)

Acceso

Xiao, G; Wei, S; Lam, K Y; Imamura, K Pág. 2203 - 2205

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

CORRESPONDENCE - Linear Complexity of a Sequence Obtained from a Periodic Sequence by Either Substituting, Inserting, or Deleting k Symbols Within One Period

Acceso

Jiang, S; Dai, Z; Imamura, K Pág. 1174 - 1177

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Ver todas las revistas