Learn More
Abstruct-A new achievable rate region for the general interference channel which extends previous results is presented and evaluated. Tbe technique used is a generalization of superposition coding to the multivariable case. A detailed computation for tbe Gaussian cbaunel case clarifies to wbat extent the new region improves previous ones. The capacity of a(More)
Abrlracr-A h u l a for the cppecity et arbitrary sbgle-wer chrurwla without feedback (mot neccgdueily Wium" stable, stationary, etc.) is proved. Capacity ie shown to e i p l the supremum, over all input processts, & the input-outpat infiqjknda QBnd as the llnainl ia praabiutJr d the normalized information density. The key to thir zbllljt is a ntw a"c sppmrh(More)
Given a channel and an input process we study the minimum randomness of those input processes whose output statistics approximate the original output statistics with arbitrary accuracy. We introduce the notion of resolvability of a channel, defined as the number of random bits required per channel use in order to generate an input that achieves arbitrarily(More)
Given a general network of discrete memoryless independent channels with multiple supply nodes and a single sink node, a Slepian-Wolf-Cover type of problem of transmitting multiple correlated informations through the network from the supply nodes to the sink node is considered from the source-channel matching point of view. By introducing the concept of(More)
Absfruct-The multiterminal hypothesis testing H: XY against @: XY is considered where X”( x”) and Y”(Y”) are separately encoded at rates R, and R *, respectively. The problem is to determine the min imum & of the second kind of error probability, under the condition that the first kind of error probability a,, I c for a prescribed 0 i c < 1. A good lower(More)