2 citations · 2 across the 2 of their papers we have counts for
7 papers
Modulation Codes for Flash Memory Based on Load-Balancing Theory
Fan Zhang, Henry D. Pfister
In this paper, we consider modulation codes for practical multilevel flash memory storage systems with cell levels. Instead of maximizing the lifetime of the device [Ajiang-isit07-…
Can Iterative Decoding for Erasure Correlated Sources be Universal?
Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan
In this paper, we consider a few iterative decoding schemes for the joint source-channel coding of correlated sources. Specifically, we consider the joint source-channel coding of…
A Rate-Distortion Perspective on Multiple Decoding Attempts for Reed-Solomon Codes
Phong S. Nguyen, Henry D. Pfister, Krishna R. Narayanan
Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rat…
Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity
Henry D. Pfister, Igal Sason
The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {\em bounded complexity},…
Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity
Henry D. Pfister, Igal Sason
The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {\em bounded complexity} p…
Bounds on the decoding complexity of punctured codes on graphs
H. Pfister, I. Sason, R. Urbanke
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bin…