164 citations · 1.2k across the 72 of their papers we have counts for
6 papers · 2 filters
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…
First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory
Santhosh Kumar, Jean-Francois Chamberland, Henry D. Pfister
This article considers the performance of digital communication systems transmitting messages over finite-state erasure channels with memory. Information bits are protected from ch…
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…
On The Performance of Random Block Codes over Finite-State Fading Channels
Fatemeh Hamidi-Sepehr, Jean-Francois Chamberland, Henry Pfister
As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffi…
Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding
Yung-Yih Jian, Henry D. Pfister, Krishna R. Narayanan
A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) m…
Code Design for the Noisy Slepian-Wolf Problem
Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan
We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded (using codes of fixed rate) and transmitted over two independent binary memoryless symm…