Rate-adaptive BCH codes for distributed source coding

Matteo Salmistraro, Knud J. Larsen, Søren Forchhammer

Research output: Contribution to journalJournal articleResearchpeer-review

467 Downloads (Pure)

Abstract

This paper considers Bose-Chaudhuri-Hocquenghem (BCH) codes for distributed source coding. A feedback channel is employed to adapt the rate of the code during the decoding process. The focus is on codes with short block lengths for independently coding a binary source X and decoding it given its correlated side information Y. The proposed codes have been analyzed in a high-correlation scenario, where the marginal probability of each symbol, Xi in X, given Y is highly skewed (unbalanced). Rate-adaptive BCH codes are presented and applied to distributed source coding. Adaptive and fixed checking strategies for improving the reliability of the decoded result are analyzed, and methods for estimating the performance are proposed. In the analysis, noiseless feedback and noiseless communication are assumed. Simulation results show that rate-adaptive BCH codes achieve better performance than low-density parity-check accumulate (LDPCA) codes in the cases studied.
Original languageEnglish
Article number166
JournalEurasip Journal on Advances in Signal Processing
Volume2013
Number of pages14
ISSN1687-6172
DOIs
Publication statusPublished - 2013

Bibliographical note

Copyright 2013 Salmistraro et al. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Keywords

  • Distributed source coding
  • Rate-adaptive error-correcting codes
  • R ate-adaptive BCH codes
  • BCH codes

Fingerprint

Dive into the research topics of 'Rate-adaptive BCH codes for distributed source coding'. Together they form a unique fingerprint.

Cite this