A new achievable rate region for the general interference channel which extends previous results is presented and evaluated and the capacity of a class of Gaussian interference channels is established.Expand

A unified treatment of a large class of multiterminal noiseless source coding problems including all previously studied situations is presented. A unified achievable rate region is established for… Expand

The identifiability problem is completely solved by linear algebra, where a block structure of a Markov transition matrix plays a fundamental role, and from which the minimum degree of freedom for a source is revealed.Expand

For decoding low-density parity-check (LDPC) codes on discrete memoryless channels, a method to quantize messages and to find message-passing decoding functions for the variable and check nodes is developed and noise thresholds close to those of belief propagation are obtained.Expand

The necessary and sufficient condition for the set of all achievable rates to coincide with the Slepian-Wolf region whenever the probability density p(x, y) is positive for all (x,y) is established.Expand

The authors present the answer to a so-called converse problem by giving the explicit form of the power exponent. This strong converse should be regarded as completing a weak converse previously… Expand

We present a simplified form of the HK (= HanKobayashi) achievable rate region for the general interference channel by using Fourier-Motzkin algorithm, as well as a simplified form of the HK region… Expand