On the significance of binning in a scaling-law sense

An efficient distributed source coding system with two encoders and dependent data streams must remove two kinds of redundancy: redundancy in each stream and between the two streams. The striking result of Slepian and Wolf showed that the latter can be eliminated even if each encoder only observes one of the source streams. The coding technique that permits to achieve this is often referred to as "binning." In large source networks, binning can result in considerable savings in terms of encoding rate.


Published in:
2006 IEEE Information Theory Workshop, 258-262
Presented at:
IEEE Information Theory Workshop, Punta del Este, URUGUAY, Mar 13-17, 2006
Year:
2006
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-0035-5
Keywords:
Laboratories:




 Record created 2011-10-17, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)