Learn More
—We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize(More)
• Abstract— In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's recently discovered appoach to classical channels. It involves a development of explicit large deviation(More)
The author determines for arbitrarily varying channels a) the average error capacity and b) the maximal error capacity in case of randomized encoding. A formula for the average error capacity in case of randomized encoding was announced several years ago by Dobrushin ([3]). Under a mild regularity condition this formula turns out to be valid and follows as(More)
Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that(More)