Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rate distortion bounds for binary erasure source using sparse graph codes
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7182-9543
2010 (English)In: Data Compression Conference, DCC 2010, 2010, 49-58 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider lower bounds on the rate-distortion performance for the binary erasure source (BES) introduced by Martinian and Yedidia, using sparse graph codes for compression. Our approach follows that of Kudekar and Urbanke, where lower bounds on the rate distortion performance of low-density generator matrix (LDGM) codes for the binary symmetric source (BSS) are derived. They introduced two methods for deriving lower bounds, namely the counting method and the test channel method. Based on numerical results they observed that the two methods lead to the same bound. We generalize these two methods for the BES and prove that indeed both methods lead to identical rate-distortion bounds for the BES and hence, also for the BSS.

Place, publisher, year, edition, pages
2010. 49-58 p.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-63137DOI: 10.1109/DCC.2010.95Scopus ID: 2-s2.0-77952712327OAI: oai:DiVA.org:kth-63137DiVA: diva2:481682
Conference
Data Compression Conference, DCC 2010. Snowbird, UT. 24 March 2010 - 26 March 2010
Note
QC 20120125Available from: 2012-01-22 Created: 2012-01-22 Last updated: 2012-01-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Rasmussen, Lars Kildehöj

Search in DiVA

By author/editor
Demay, GregoryRathi, VishwambharRasmussen, Lars Kildehöj
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 32 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf