REVISTA

IEEE TRANSACTIONS ON INFORMATION THEORY

ISSN: 0018-9448 Frecuencia: 7 Formato: Impresa

Tablas de contenido

53 artículos asociados

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

CORRECTION - Correction to "A Decoding Algorithm with Restrictions for Array Codes"	Solicitud
Haslach, C N; Vinck, A J Han
Pág. 479

IEEE COPYRIGHT FORM	Solicitud

Pág. 491

Block-Definition Approaches to Source Coding with a Fidelity Criterion	Solicitud
Hashimoto, T
Pág. 112 - 125

The Redundancy of Source Coding with a Fidelity Criterion -- Part II: Coding at a Fixed Rate Level with Unknown Statistics	Solicitud
Yang, E-h; Zhang, Z
Pág. 126 - 145

On Simple Oversampled A/D Conversion in L2(IR)	Solicitud
Cvetkovc, Z; Vetteru, M
Pág. 146 - 154

Noise Reduction in Oversampled Filter Banks Using Predictive Quantization	Solicitud
Bölcskei, H; Hlawatsch, F
Pág. 155 - 172

Digital Representations of Operators on Band-Limited Random Signals	Solicitud
Habib, M K
Pág. 173 - 177

On the Estimation of Buffer Overflow Probabilities from Measurements	Solicitud
Paschalidis, I Ch; Vassilaras, S
Pág. 178 - 191

Minimal Entropy of States Emerging from Noisy Quantum Channels	Solicitud
King, C; Ruskai, M B
Pág. 192 - 209

Efficient Reconstruction of Sequences	Solicitud
Levenshtein, V I
Pág. 2 - 22

Error Exponents of Modulo-Additive Noise Channels with Side Information at the Transmitter	Solicitud
Erez, U; Zamir, R
Pág. 210 - 218

The Capacity Region of Broadcast Channels with Intersymbol Interference and Colored Gaussian Noise	Solicitud
Goldsmith, A J; Effros, M
Pág. 219 - 240

Information Leakage of Feistel Ciphers	Solicitud
Heys, H M
Pág. 23 - 35

Asymptotically Optimal Water-Filling in Vector Multiple-Access Channels	Solicitud
Viswanath, P; Tse, D N C; Anantharam, V
Pág. 241 - 267

Multiuser Receivers for Randomly Spread Signals: Fundamental Limits With and Without Decision-Feedback	Solicitud
Müller, R R
Pág. 268 - 283

Indecomposable Error Sequences in Multiuser Detection	Solicitud
Luo, W; Ephremides, A
Pág. 284 - 294

Noncoherent Multiuser Detection for Nonlinear Modulation Over the Rayleig-Fading Channel	Solicitud
Russ, A; Varanasi, M K
Pág. 295 - 307

On Achievable Performance of Spatial Diversity Fading Channels	Solicitud
Diggavi, S N
Pág. 308 - 325

CORRESPONDENCE - The Estimated Cost of a Search Tree on Binary Words	Solicitud
Fedotov, A; Ryabko, B
Pág. 326 - 329

CORRESPONDENCE - Csiszàr's Cutoff Rates for Arbitrary Discrete Sources	Solicitud
Chen, P N; Alajaji, F
Pág. 330 - 337

CORRESPONDENCE - The First-Order Asymptotic of Waiting Times with Distortion Between Stationary Processes	Solicitud
Chi, Z
Pág. 338 - 346

CORRESPONDENCE - Algebraic-Geometry Codes with Asymptotic Parameters Better than the Gilbert-Varshamov and the Tsfasman-Vladuj-Zink Bounds	Solicitud
Xing, C
Pág. 347 - 351

CORRESPONDENCE - A Remark on Plotkin's Bound	Solicitud
Launey, W de; Gordon, D M
Pág. 352 - 354

CORRESPONDENCE - On a Family of Abelian Codes and Their State Complexities	Solicitud
Blackmore, T; Norton, G H
Pág. 355 - 360

Preparata Codes Through Lattices	Solicitud
Duursma, I M
Pág. 36 - 44

CORRESPONDENCE - Concatenated Codes with Fixed Inner Code and Random Outer Code	Solicitud
Barg, A; Justesen, J; Thommesen, C
Pág. 361 - 365

CORRESPONDENCE - Code Construction and Decoding of Parallel Concatenated Tail-Biting Codes	Solicitud
Weiss, C; Bettstetter, C; Riedel, S
Pág. 366 - 385

CORRESPONDENCE - New Extremal Self-Dual Codes of Lengths 36, 38, and 58	Solicitud
Kim, J-L
Pág. 386 - 392

CORRESPONDENCE - Bounds for the Weight Distribution of Weakly Self-Dual Codes	Solicitud
Roychowdhury, V P; Vatan, F
Pág. 393 - 395

CORRESPONDENCE - The Complete Weight Enumerator of Type II Codes Over Z2m and Jacobi Forms	Solicitud
Choie, Y; Kim, N
Pág. 396 - 399

CORRESPONDENCE - Maximum Distance Codes Over Rings of Order 4	Solicitud
Doughert, S T; Shiromoto, K
Pág. 400 - 403

CORRESPONDENCE - The Burst Weight Distributions of Maximum-Hamming-Distance- Separable Codes	Solicitud
Hamada, M
Pág. 404 - 406

CORRESPONDENCE - On the Weight Distributions of Optimal Cosets of the First-Order Reed-Muller Codes	Solicitud
Canteaut, A
Pág. 407 - 412

CORRESPONDENCE - On the Covering Radius of Ternary Negacyclic Codes with Length up to 26	Solicitud
Baicheva, T S
Pág. 413 - 415

CORRESPONDENCE - Linear Codes with Covering Radius R = 2. 3 and Codimension tR	Solicitud
Davydov, A A; Östergård, P R J
Pág. 416 - 420

CORRESPONDENCE - On Binary Cyclic Codes with Codewords of Weight Three and Binary Sequences with the Trinomial Property	Solicitud
Charpin, P; Tieläväinen, A; Zinoviev, V
Pág. 421 - 425

CORRESPONDENCE - A Conjecture on Binary Sequences with the "Trinomial Property"	Solicitud
Cusick, T W; Gong, G
Pág. 426 - 427

CORRESPONDENCE - New Families of Binary Sequences with Optimal Three-Level Autocorrelation	Solicitud
Ding, C; Helleseth, T; Martinsen, H
Pág. 428 - 432

CORRESPONDENCE - On Codes that Avoid Specified Differences	Solicitud
Moision, B E; Orlitsky, A; Siegel, P H
Pág. 433 - 441

CORRESPONDENCE - On the Optimal Markov Chain of IS Simulation	Solicitud
Nakagawa, K
Pág. 442 - 445

CORRESPONDENCE - Quasi-Convexity and Optimal Binary Fusion for Distributed Detection with Identical Sensors in Generalized Gaussian Noise	Solicitud
Shi, W; Sun, T W; Wesel, R D
Pág. 446 - 449

On Algebraic Soft-Decision Decoding Algorithms for BCH Codes	Solicitud
Kamiya, N
Pág. 45 - 58

CORRESPONDENCE - On the Relative Error Probabilities of Linear Multiuser Detectors	Solicitud
Moustakides, G V; Poor, H V
Pág. 450 - 456

CORRESPONDENCE - Recursive Consistent Estimation with Bounded Noise	Solicitud
Rangan, S; Goyal, V K
Pág. 457 - 463

CORRESPONDENCE - Bounds for Sparse Planar and Volume Arrays	Solicitud
Meurisse, Y; Delmas, J-P
Pág. 464 - 467

CORRESPONDENCE - Bounds on Entropy in a Guessing Game	Solicitud
Santis, A De; Gaggia, A G; Vaccaro, U
Pág. 468 - 473

CORRESPONDENCE - Quantum Data Processing	Solicitud
Ahlswede, R; Löber, P
Pág. 474 - 478

CONTRIBUTORS //	Solicitud

Pág. 480 - 488

CALL FOR PAPERS - // Special Issue on Shannon Theory: Perspective, Trends, and Applications	Solicitud

Pág. 489 - 490

Soft-Decision Decoding Using Punctured Codes	Solicitud
Dumer, I
Pág. 59 - 71

Some Basic Properties of Fix-Free Codes	Solicitud
Ye, C; Yeung, R W
Pág. 72 - 87

On-Line Adaptive Canonical Prefix Coding with Bounded Compression Loss	Solicitud
Turpine, A; Moffat, A
Pág. 88 - 98

Natural Type Selection in Adaptive Lossy Compression	Solicitud
Zamir, R; Rose, K
Pág. 99 - 111