60 citations · 71 across the 4 of their papers we have counts for
5 papers
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…
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…
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…
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…
Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees
Yung-Yih Jian, Henry D. Pfister
Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational compl…