22 citations · 24 across the 6 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2022
A Criterion for Decoding on the BSC
Anup Rao, Oscar Sprumont
We present an approach to showing that a linear code is resilient to random errors. We use this approach to obtain decoding results for both transitive codes and Reed-Muller codes.…
cs.IT2011★ 22 cited
Information Equals Amortized Communication
Mark Braverman, Anup Rao
We show how to efficiently simulate the sending of a message M to a receiver who has partial information about the message, so that the expected number of bits communicated in the…