Statistical mechanics of the data compression theorem

From MaRDI portal
Publication:4545294

DOI10.1088/0305-4470/35/8/101zbMATH Open1003.94018arXivcond-mat/0106209OpenAlexW2045896434MaRDI QIDQ4545294FDOQ4545294


Authors: Tatsuto Murayama Edit this on Wikidata


Publication date: 15 August 2002

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: We analyze the performance of a linear code used for a data compression of Slepian-Wolf type. In our framework, two correlated data are separately compressed into codewords employing Gallager-type codes and casted into a communication network through two independent input terminals. At the output terminal, the received codewords are jointly decoded by a practical algorithm based on the Thouless-Anderson-Palmer approach. Our analysis shows that the achievable rate region presented in the data compression theorem by Slepian and Wolf is described as first-order phase transitions among several phases. The typical performance of the practical decoder is also well evaluated by the replica method.


Full work available at URL: https://arxiv.org/abs/cond-mat/0106209




Recommendations





Cited In (6)





This page was built for publication: Statistical mechanics of the data compression theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4545294)