REVISTA

IEEE TRANSACTIONS ON INFORMATION THEORY

ISSN: 0018-9448 Frecuencia: 7 Formato: Impresa

Tablas de contenido

43 artículos asociados

Volumen 47 Número 5 Parte 0 Año 2001

CORRESPONDENCE - On the Duals of Binary BCH Codes	Solicitud
Voloch, J F
Pág. 2050

CORRECTION - Errata for "Good Error-Correcting Codes Based on Very Sparse Matrices"	Solicitud
MacKay, D J C
Pág. 2101

CONTRIBUTORS //	Solicitud

Pág. 2102

Information Geometry on Hierarchy of Probability Distributions	Solicitud
Amari, S-I
Pág. 1701 - 1711

Strong Optimality of the Normalized ML Models as Universal Codes and Information in Data	Solicitud
Rissanen, J
Pág. 1712 - 1717

Multiple-Description Vector Quantization with Lattice Codebooks: Design and Analysis	Solicitud
Vaishampayan, V A; Sloane, N J A; Servetto, S D
Pág. 1718 - 1734

On the Robustness of Single-Loop Sigma-Delta Modulation	Solicitud
Güntürk, C S; Lagarias, J C; Vaishampayan, V A
Pág. 1735 - 1744

On Unique, Multiset, and Set Decipherability of Three-Word Codes	Solicitud
Blanchet-Sadri, F
Pág. 1745 - 1757

On Coset Weight Distributions of the Z4-Linear Goethals Code	Solicitud
Helleseth, T; Zinoviev, V
Pág. 1758 - 1772

Binary Images of Cyclic Codes over Z4	Solicitud
Wolfmann, J
Pág. 1773 - 1779

Constructing Critical Indecomposable Codes	Solicitud
Walker, J L
Pág. 1780 - 1795

Lower Bounds on the Anticipation of Encoders for Input-Constrained Channels	Solicitud
Ruckenstein, G; Roth, R M
Pág. 1796 - 1812

Stream-Oriented Turbo Codes	Solicitud
Hall, E K; Wilson, S G
Pág. 1813 - 1831

MAP Symbol Decoding in Channels with Error Bursts	Solicitud
Turin, W
Pág. 1832 - 1838

Partial-Prefix Synchronizable Codes	Solicitud
Wijngaarden, A J van; Morita, H
Pág. 1839 - 1848

Twofold Universal Prediction Schemes for Achieving the Finite-State Predictability of a Noisy Individual Binary Sequence	Solicitud
Weissman, T; Merhav, N; Somekh-Baruch, A
Pág. 1849 - 1866

Optimization of Barron Density Estimate	Solicitud
Vajda, I; Meulen, E C van der
Pág. 1867 - 1883

Adaptive Context Trees and Text Clustering	Solicitud
Vert, J-P
Pág. 1884 - 1901

Rademacher Penalties and Structural Risk Minimization	Solicitud
Koltchinskii, V
Pág. 1902 - 1914

Pattern Recognition Algorithms Based on Space-Filling Curves and Orthogonal Expansions	Solicitud
Skubalska-Rafajlowicz, E
Pág. 1915 - 1927

Performance of Reduced-Rank Linear Interference Suppression	Solicitud
Honig, M L; Xiao, W
Pág. 1928 - 1946

Cumulant-Based Independence Measures for Linear Mixtures	Solicitud
Pesquet, J-C; Moreau, E
Pág. 1947 - 1956

On the Performance of Linear Parallel Interference Cancellation	Solicitud
Brown III, D R; Motani, M; Veeravalli, V V; Poor, H V; Johnson Jr, C R
Pág. 1957 - 1970

The Throughput of Hybrid-ARQ Protocols for the Gaussian Collision Channel	Solicitud
Caire, G; Tuninetti, D
Pág. 1971 - 1988

Iterative Construction of Optimum Signature Sequence Sets in Synchronous CDMA Systems	Solicitud
Ulukus, S; Yates, R D
Pág. 1989 - 1998

Error Exponents for the Two-User Poisson Multiple-Access Channel	Solicitud
Bross, S I; Burnashev, M V; Shamai, S
Pág. 1999 - 2016

Gauges and Gauge Transformations for Uncertainty Description of Geometric Structure with Indeterminacy	Solicitud
Kanatani, K; Morris, D D
Pág. 2017 - 2028

CORRESPONDENCE - On the Whiteness of High-Resolution Quantization Errors	Solicitud
Viswanathan, H; Zamir, R
Pág. 2029 - 2038

CORRESPONDENCE - Binomial and Poisson Distributions as Maximum Entropy Distributions	Solicitud
Harremoës, P
Pág. 2039 - 2041

CORRESPONDENCE - Families of Distributions Characterized by Entropy	Solicitud
Ebrahimi, N
Pág. 2042 - 2044

CORRESPONDENCE - Constructions of MDS-Convolutional Codes	Solicitud
Smarandache, R; Gluesing-Luerssen, H; Rosenthal, J
Pág. 2045 - 2049

CORRESPONDENCE - Self-Dual Codes over Fp and Weighing Matrices	Solicitud
Arasu, K T; Gulliver, T A
Pág. 2051 - 2054

CORRESPONDENCE - Asymptotically Good Quantum Codes Exceeding the Ashikhmin-Litsyn-Tsfasman Bound	Solicitud
Chen, H; Ling, S; Xing, C
Pág. 2055 - 2058

CORRESPONDENCE - Some Good Quantum Error-Correcting Codes from Algebraic-Geometric Codes	Solicitud
Chen, H
Pág. 2059 - 2060

CORRESPONDENCE - On the Svanström Bound for Ternary Constant-Weight Codes	Solicitud
Fu, F-W; Kløve, T; Luo, Y; Wei, V K
Pág. 2061 - 2064

CORRESPONDENCE - Relationships Between Different Error-Correcting Capabilities of a Code	Solicitud
Konstantinidis, S
Pág. 2065 - 2068

CORRESPONDENCE - Optimal Block Codes for M-ary Runlength-Constrained Channels	Solicitud
Datta, S; McLaughlin, S W
Pág. 2069 - 2077

CORRESPONDENCE - Achieving Optimum Coded Diversity with Scalar Codes	Solicitud
Ganesan, G; Stoica, P
Pág. 2078 - 2080

CORRESPONDENCE - Minimax Rate Adaptive Estimation over Continuous Hyper-Parameters	Solicitud
Yang, Y
Pág. 2081 - 2085

CORRESPONDENCE - The Optimal Transform for the Discrete Hirschman Uncertainty Principle	Solicitud
Przebinda, T; DeBrunner, V; Özaydin, M
Pág. 2086 - 2090

CORRESPONDENCE - A Construction of OFDM 16-QAM Sequences Having Low Peak Powers	Solicitud
Rössing, C; Tarokh, V
Pág. 2091 - 2093

CORRESPONDENCE - On the Linear Complexity of Hall's Sextic Residue Sequences	Solicitud
Kim, J-H; Song, H-Y
Pág. 2094 - 2095

CORRESPONDENCE - On the Achievability of the Cramér-Rao Bound for Poisson Distribution	Solicitud
Aharoni, R; Lee, D
Pág. 2096 - 2100