Distributed coding using punctured quasi-arithmetic codes for memory and memoryless sources

Authors:
Simon Malinowski;Xavi Artigas;Christine Guillemot;Luis Torres
Affiliations:
IRISA, Univ. of Rennes;Technical University of Catalunya;IRISA, INRIA;Technical University of Catalunya
Venue:
PCS'09 Proceedings of the 27th conference on Picture Coding Symposium
Year:
2009

Citing 3
Cited 0

Compression with Side Information Using Turbo Codes

DCC '02 Proceedings of the Data Compression Conference
Soft and joint source-channel decoding of quasi-arithmetic codes

EURASIP Journal on Applied Signal Processing
Lossless and near-lossless source coding for multiple access networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the use of punctured quasi-arithmetic (QA) codes for the Slepian-Wolf problem. These entropy codes are defined by finite state machines for memoryless and first-order memory sources. Puncturing an entropy coded bit-stream leads to an ambiguity at the decoder side. The decoder makes use of a correlated version of the original in order to remove this ambiguity. A complete DSC scheme based on QA encoding with side information at the decoder is presented. The proposed scheme is adapted to memoryless and first-order memory sources. Simulation results reveal that the proposed scheme is efficient in terms of decoding performance for short sequences compared to well-known DSC using channel codes.