7 citations · 38 across the 38 of their papers we have counts for
Showing 2014 · cs.ITShow all
3 papers · 2 filters
cs.IT2014★ 2 cited
Simplified Erasure/List Decoding
Nir Weinberger, Neri Merhav
We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in…
cs.IT2014★ 1 cited
Erasure/List Random Coding Error Exponents Are Not Universally Achievable
Wasim Huleihel, Nir Weinberger, Neri Merhav
We study the problem of universal decoding for unknown discrete memoryless channels in the presence of erasure/list option at the decoder, in the random coding regime. Specifically…
cs.IT2014★ 7 cited
Optimum Trade-offs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian-Wolf Coding
Nir Weinberger, Neri Merhav
We analyze the optimal trade-off between the error exponent and the excess-rate exponent for variable-rate Slepian-Wolf codes. In particular, we first derive upper (converse) bound…