Rate-adaptive BCH coding for Slepian-Wolf coding of highly correlated sources

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

View graph of relations

This paper considers using BCH codes for distributed source coding using feedback. The focus is on coding using short block lengths for a binary source, X, having a high correlation between each symbol to be coded and a side information, Y, such that the marginal probability of each symbol, Xi in X, given Y is highly skewed. In the analysis, noiseless feedback and noiseless communication are assumed. A rate-adaptive BCH code is presented and applied to distributed source coding. Simulation results for a fixed error probability show that rate-adaptive BCH achieves better performance than LDPCA (Low-Density Parity-Check Accumulate) codes for high correlation between source symbols and the side information.
Original languageEnglish
Title of host publication2012 Data Compression Conference
PublisherIEEE
Publication date2012
Pages237-246
ISBN (print)978-1-4673-0715-4
DOIs
StatePublished

Conference

ConferenceData Compression Conference (DCC)
CountryUnited States
CitySnowbird, UT
Period10/04/1212/04/12
Internet addresshttp://pages.cs.brandeis.edu/~dcc/
CitationsWeb of Science® Times Cited: 0
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 7991404