activity
20092013
most citedA Simple Proof of Maxwell Saturation for Coupled Scalar Recursions

60 citations · 86 across the 7 of their papers we have counts for

collaborators
Showing cs.ITShow all

8 papers · 1 filter

cs.IT2013★ 60 cited

A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions

Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen +1

Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memor…

cs.IT2012

A Simple Proof of Threshold Saturation for Coupled Vector Recursions

Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen +1

Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principl…

cs.IT2012

A Simple Proof of Threshold Saturation for Coupled Scalar Recursions

Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen +1

Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryles…

cs.IT2011★ 6 cited

Universal Codes for the Gaussian MAC via Spatial Coupling

Arvind Yedla, Phong S. Nguyen, Henry D. Pfister +1

We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknow…

cs.IT2011★ 10 cited

Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels

Phong S. Nguyen, Arvind Yedla, Henry D. Pfister +1

Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the c…

cs.IT2010★ 10 cited

On Multiple Decoding Attempts for Reed-Solomon Codes: A Rate-Distortion Approach

Phong S. Nguyen, Henry D. Pfister, Krishna R. Narayanan

One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flippin…

cs.IT2010

A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes

Phong S. Nguyen, Henry D. Pfister, Krishna R. Narayanan

Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory,…

cs.IT2009

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…