- Joint Iterative Decoding of LDPC Codes for Channels with Memory and Erasure Noise
- Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes
- Upper Bounds on the MAP Threshold of Iterative Decoding Systems with Erasure Noise
- Compressed Sensing and Linear Codes over Real Numbers
- Capacity Upper Bounds for the Deletion Channel Suhas Diggavi, Michael Mitzenmacher, and Henry D. Pfister
- Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
- On the Achievable Information Rates of Finite State ISI Channels Henry D. Pfister, Joseph B. Soriaga, and Paul H. Siegel
- Signature Page . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv
- Introduction 1.1 Layman's Summary
- 2352 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 7, JULY 2005 Capacity-Achieving Ensembles for the Binary
- 1416 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 4, APRIL 2007 Determining and Approaching Achievable Rates of
- 1962 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 12, DECEMBER 2003 Transactions Letters________________________________________________________________
- The Capacity of Finite State Channels 4.1 Introduction
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 6, JUNE 2003 1425 The Serial Concatenation of Rate-1 Codes Through
- Joint Iterative Decoding of LDPC Codes and Channels with Memory
- UNIVERSITY OF CALIFORNIA, SAN DIEGO On the Capacity of Finite State Channels and
- IEEE Communications Magazine February 200696 0163-6804/06/$20.00 2006 IEEE EVOLVING TECHNOLOGIES FOR 3G CELLULAR
- ABSTRACT OF THE DISSERTATION On the Capacity of Finite State Channels and
- On the Iterative Decoding of High Rate LDPC Codes With Applications in Compressed Sensing
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 9, SEPTEMBER 2003 2141 Capacity-Approaching Bandwidth-Efficient Coded
- Bounds on the Decoding Complexity of Punctured Codes on Graphs
- The Serial Concatenation of Rate-1 Codes Through Uniform Interleavers
- The Serial Concatenation of Rate-1 Codes Through Uniform Random Interleavers
- Coding Theorems for Convolutional Accumulate-m Codes
- Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the
- Finite-Length Analysis of a Capacity-Achieving Ensemble for the Binary Erasure Channel
- International Symposium on Information Theory and Its Applications Honolulu, Hawaii, U.S.A., November 58, 2000
- Queueing Behavior of the Gilbert-Elliott Channel: BCH Codes and Poisson Arrivals
- A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes
- Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Coupled Trees
- A Rate-Distortion Perspective on Multiple Decoding Attempts for Reed-Solomon Codes
- IMP: A Message-Passing Algorithm for Matrix Completion
- Universality for the Noisy Slepian-Wolf Problem via Spatial Coupling
- On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming
- Code Rate, Queueing Behavior and the Correlated Erasure Channel
- On the Queueing Behavior of Random Codes over a Gilbert-Elliott Erasure Channel
- Can Iterative Decoding for Erasure Correlated Sources be Universal? Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan
- Modulation Codes for Flash Memory Based on Load-Balancing Theory
- LDPC Code Design for Transmission of Correlated Sources Across Noisy Channels Without CSIT
- Universal Codes for the Gaussian MAC via Spatial Coupling
- Large Deviations on Empirical Service for Erasure Channels with Memory
