16 citations · 58 across the 26 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.IT2013
Sampling versus Random Binning for Multiple Descriptions of a Bandlimited Source
Adam Mashiach, Jan Ostergaard, Ram Zamir
Random binning is an efficient, yet complex, coding technique for the symmetric L-description source coding problem. We propose an alternative approach, that uses the quantized sam…
cs.IT2013
The Random Coding Bound Is Tight for the Average Linear Code or Lattice
Yuval Domb, Ram Zamir, Meir Feder
In 1973, Gallager proved that the random-coding bound is exponentially tight for the random code ensemble at all rates, even below expurgation. This result explained that the rando…