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

Søren Forchhammer; Matteo Salmistraro; Knud J. Larsen; Xin Huang; Huynh Van Luong

doi:10.1109/DCC.2012.31

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

Søren Forchhammer, Matteo Salmistraro, Knud J. Larsen, Xin Huang, Huynh Van Luong

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

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 language	English
Title of host publication	2012 Data Compression Conference
Publisher	IEEE
Publication date	2012
Pages	237-246
ISBN (Print)	978-1-4673-0715-4
DOIs	https://doi.org/10.1109/DCC.2012.31
Publication status	Published - 2012
Event	Data Compression Conference (DCC) - Snowbird, UT, United States Duration: 10 Apr 2012 → 12 Apr 2012 http://pages.cs.brandeis.edu/~dcc/

Conference

Conference	Data Compression Conference (DCC)
Country/Territory	United States
City	Snowbird, UT
Period	10/04/2012 → 12/04/2012
Internet address	http://pages.cs.brandeis.edu/~dcc/

Access to Document

10.1109/DCC.2012.31

OpenUrl availability

Full text

Cite this

@inproceedings{d919a158dab64df7ba12efffac973d22,

title = "Rate-adaptive BCH coding for Slepian-Wolf coding of highly correlated sources",

abstract = "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.",

author = "S{\o}ren Forchhammer and Matteo Salmistraro and Larsen, {Knud J.} and Xin Huang and Luong, {Huynh Van}",

year = "2012",

doi = "10.1109/DCC.2012.31",

language = "English",

isbn = "978-1-4673-0715-4",

pages = "237--246 ",

booktitle = "2012 Data Compression Conference",

publisher = "IEEE",

address = "United States",

note = "Data Compression Conference (DCC) ; Conference date: 10-04-2012 Through 12-04-2012",

url = "http://pages.cs.brandeis.edu/~dcc/",

}

TY - GEN

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

AU - Forchhammer, Søren

AU - Salmistraro, Matteo

AU - Larsen, Knud J.

AU - Huang, Xin

AU - Luong, Huynh Van

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

U2 - 10.1109/DCC.2012.31

DO - 10.1109/DCC.2012.31

M3 - Article in proceedings

SN - 978-1-4673-0715-4

SP - 237

EP - 246

BT - 2012 Data Compression Conference

PB - IEEE

T2 - Data Compression Conference (DCC)

Y2 - 10 April 2012 through 12 April 2012

ER -

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

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this