conference paper
On the significance of binning in a scaling-law sense
2006
2006 IEEE Information Theory Workshop
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.
Type
conference paper
Web of Science ID
WOS:000245205900056
Author(s)
Eswaran, Krishnan
Date Issued
2006
Published in
2006 IEEE Information Theory Workshop
ISBN of the book
978-1-4244-0035-5
Start page
258
End page
262
Subjects
Editorial or Peer reviewed
REVIEWED
Written at
OTHER
EPFL units
| Event name | Event place | Event date |
Punta del Este, URUGUAY | Mar 13-17, 2006 | |
Available on Infoscience
October 17, 2011
Use this identifier to reference this record