REVISTA

IEEE TRANSACTIONS ON INFORMATION THEORY

ISSN: 0018-9448 Frecuencia: 7 Formato: Impresa

Tablas de contenido

32 artículos asociados

Volumen 48 Número 1 Parte 0 Año 2002

2001 INFORMATION THEORY SOCIETY PAPER AWARD - Editorial: - The TRANSACTIONS Goes Monthly	Solicitud
Siegel, P H
Pág. 3

IEEE COPYRIGHT FORM	Solicitud

Pág. 343

Bounds and Constructions for Ternary Constant-Composition Codes	Solicitud
Svanström, M; Östergård, P R J; Bogdanova, G T
Pág. 101 - 111

Bounds on the Performance of Belief Propagation Decoding	Solicitud
Burshtein, D; Miller, G
Pág. 112 - 122

Labelings and Encoders With the Uniform Bit Error Property With Applications to Serially Concatenated Trellis Codes	Solicitud
Garello, R; Montorsi, G; Benedetto, S; Divsalar, D; Pollara, F
Pág. 123 - 136

Tailbiting Codes: Bounds and Search Results	Solicitud
Bocharova, I E; Johannesson, R; Kudryashov, B D; Ståhl, P
Pág. 137 - 148

Woven Convolutional Codes 1: Encoder Properties	Solicitud
Höst, S; Johannesson, R; Zyablov, V V
Pág. 149 - 161

DC-Free Binary Convolutional Coding	Solicitud
Wadayama, T; Vinck, A J H
Pág. 162 - 173

Asymmetric Multiple Description Lattice Vector Quantizers	Solicitud
Diggavi, S N; Sloane, N J A; Vaishampayan, V A
Pág. 174 - 191

Dithered Lattice-Based Quantizers for Multiple Descriptions	Solicitud
Frank-Dayan, Y; Zamir, R
Pág. 192 - 204

On the Redundancy-of Trellis Lossy Source Coding	Solicitud
Zhou, G; Zhang, Z
Pág. 205 - 218

Synchronization Recovery of Variable-Length Codes	Solicitud
Zhou, G; Zhang, Z
Pág. 219 - 227

A Sharp Upper Bound for the Probability of Error of the Likelihood Ratio Test for Detecting Signals in White Gaussian Noise	Solicitud
Pastor, D; Gay, R; Groenenboom, A
Pág. 228 - 238

Covering Numbers for Support Vector Machines	Solicitud
Guo, Y; Bartlett, P L; Shawe-Taylor, J; Williamson, R C
Pág. 239 - 250

Rademacher Averages and Phase Transitions in Glivenko-Cantelli Classes	Solicitud
Mendelson, S
Pág. 251 - 263

Multicast Topology Inference From Measured End-to-End Loss	Solicitud
Duffield, N G; Horowitz, J; Presti, F Lo; Towsley, D
Pág. 26 - 45

Comparison of Worst Case Errors in Linear and Neural Network Approximation	Solicitud
Kurková, V; Sanguineti, M
Pág. 264 - 275

CORRESPONDENCE - Quantum Signal Propagation in Depolarizing Channels	Solicitud
Pippenger, N
Pág. 276 - 277

CORRESPONDENCE - Modifications of Patterson-Wiedemann Functions for Cryptographic Applications	Solicitud
Maitra, S; Sarkar, P
Pág. 278 - 284

CORRESPONDENCE - New Binary Linear Codes From Algebraic Curves	Solicitud
Leung, K H; Ling, S; Xing, C
Pág. 285 - 286

CORRESPONDENCE - Error Performance Analysis for Reliability-Based Decoding Algorithms	Solicitud
Fossorier, M P C; Lin, S
Pág. 287 - 292

CORRESPONDENCE - Optimized Turbo Codes for Delay Constrained Applications	Solicitud
Daneshgaran, F; Mondin, M
Pág. 293 - 304

CORRESPONDENCE - On Multiple Insertion/Deletion Correcting Codes	Solicitud
Helberg, A S J; Ferreira, H C
Pág. 305 - 308

CORRESPONDENCE - A Note on the Poor-Verdú Upper Bound for the Channel Reliability Function	Solicitud
Alajaji, F; Chen, P-N; Rached, Z
Pág. 309 - 312

CORRESPONDENCE - Strong Law of Large Numbers and Shannon-McMillan Theorem for Markov Chain Fields on Trees	Solicitud
Yang, W; Liu, W
Pág. 313 - 317

CORRESPONDENCE - Maximum Independence and Mutual Information	Solicitud
Meo, R
Pág. 318 - 323

CORRESPONDENCE - Iterative Nonparametric Estimation of a Log-Optimal Portfolio Selection Function	Solicitud
Walk, H; Yakowitz, S
Pág. 324 - 333

CONTRIBUTORS //	Solicitud

Pág. 334 - 342

Capacities of Time-Varying Multiple-Access Channels With Side Information //	Solicitud
Das, A; Narayan, P
Pág. 4 - 25

Power Levels and Packet Lengths in Random Multiple Access	Solicitud
Luo, W; Ephremides, A
Pág. 46 - 58

Links Between Complexity Theory and Constrained Block Coding	Solicitud
Stockmeyer, L; Modha, D S
Pág. 59 - 88

Designing Lexicographic Codes With a Given Trellis Complexity	Solicitud
Trachtenberg, A
Pág. 89 - 100