155 citations · 369 across the 17 of their papers we have counts for
15 papers · 1 filter
Sliding-Window Superposition Coding:Two-User Interference Channels
Lele Wang, Young-Han Kim, Chiao-Yi Chen +2
A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access…
Polar Coding for Processes with Memory
Eren Sasoglu, Ido Tal
We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a channel. The memory may be…
Reed-Muller Codes Achieve Capacity on Erasure Channels
Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli +3
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relyin…
Reed-Muller Codes Achieve Capacity on Erasure Channels
Santhosh Kumar, Henry D. Pfister
This paper introduces a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather th…
Reed-Muller Codes Achieve Capacity on the Binary Erasure Channel under MAP Decoding
Shrinivas Kudekar, Marco Mondelli, Eren Şaşoğlu +1
We show that Reed-Muller codes achieve capacity under maximum a posteriori bit decoding for transmission over the binary erasure channel for all rates . The proof is gen…
Optimal Haplotype Assembly from High-Throughput Mate-Pair Reads
Govinda M. Kamath, Eren Şaşoğlu, David Tse
Humans have pairs of homologous chromosomes. The homologous pairs are almost identical pairs of chromosomes. For the most part, differences in homologous chromosome occur at c…