Publication: Research - peer-review › Article in proceedings – Annual report year: 2012
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.
|Title||2012 Data Compression Conference|
|Conference||Data Compression Conference (DCC)|
|Period||10/04/12 → 12/04/12|
|Citations||Web of Science® Times Cited: 0|
Loading map data...