Statistical Mechanics of Linear Compression Codes in Network Communication

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