149 citations · 539 across the 71 of their papers we have counts for
4 papers · 2 filters
On Modulo-Sum Computation over an Erasure Multiple Access Channel
Ashish Khisti, Brett Hern, Krishna Narayanan
We study computation of a modulo-sum of two binary source sequences over a two-user erasure multiple access channel. The channel is modeled as a binary-input, erasure multiple acce…
Joint Compute and Forward for the Two Way Relay Channel with Spatially Coupled LDPC Codes
Brett Hern, Krishna Narayanan
We consider the design and analysis of coding schemes for the binary input two way relay channel with erasure noise. We are particularly interested in reliable physical layer netwo…
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…