Statistical Mechanics of Linear Compression Codes in Network Communication

Simple item page
dc.creatorMurayama, Tatsuto
dc.date2001-06-12
dc.date.accessioned2026-07-07T02:41:43Z
dc.date.available2026-07-07T02:41:43Z
dc.descriptionWe 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.
dc.description8 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0106209
dc.identifierhttp://arxiv.org/abs/cond-mat/0106209
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/17855
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleStatistical Mechanics of Linear Compression Codes in Network Communication
dc.typetext

Files

Collections

arXiv