In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that the source coding dual of the binary erasure channel coding problem, binary erasure quantization, is solved at a nearly optimal rate with application of duals of LT and raptor codes by a belief propagation-like algorithm which amounts to a graph pruning procedure. Furthermore, this quantizing scheme is rate adaptive, i.e., its rate can be modified on-the-fly in order to adapt to the source distribution, very much like LT and raptor codes are able to adapt their rate to the erasure probability of a channel.
|Translated title of the contribution||Rate adaptive binary ersure equantiation with dual fountain codes|
|Title of host publication||Globecom 2008, New Orleans|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||1 - 5|
|Number of pages||5|
|Publication status||Published - Nov 2008|
|Event||Global Telecommunications Conference, 2008 (GLOBECOM 2008) - New Orleans, United States|
Duration: 1 Nov 2008 → …
|Conference||Global Telecommunications Conference, 2008 (GLOBECOM 2008)|
|Period||1/11/08 → …|
Bibliographical noteRose publication type: Conference contribution
Additional information: With accompanying conference poster
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- fountain codes