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

Jiang

Dai

Imamura

Resumen

No disponible

PÁGINAS

pp. 1174 - 1177

NÚMERO

Volumen: 46 Número: 3 Parte: 0 (2000)

MATERIAS

INGENIERÍA Y CONSTRUCCIÓN CIVIL

REVISTAS SIMILARES

Artículos similares

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 - Image/Video Processing - Hybrid Estimation of Navigation Parameters from Aerial Image Sequence

Acceso

Sim, D-G; Jeong, S-Y; Lee, D-H; Park, R-H; Kim, R-C; Lee, S U; Kim, I C Pág. 429 - 434

Revista: IEEE TRANSACTIONS ON IMAGE PROCESSING

CORRESPONDENCE - Disjointness of Random Sequence Sets with Respect to Distinct Probability Measures

Acceso

Han, T S; Hamada, M Pág. 756 - 760

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

CORRESPONDENCE - On the Average Near-Far Resistance for MMSE Detection of Direct Sequence CDMA Signals with Random Spreading

Acceso

Madhow, U; Honig, M L Pág. 2039 - 2045

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

CORRESPONDENCE - A Soft Output Hybrid Algorithm for ML/MAP Sequence Estimation

Acceso

Brushe, G D; Mahony, R E; Moore, J B Pág. 3129 - 3133

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Ver todas las revistas