#### Filter Results:

#### Publication Year

1975

2013

#### Co-author

#### Key Phrase

#### Publication Venue

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)

For the discrete memoryless channel (X ; Y; W) we give characterisations of the zero{ error erasure capacity C er and the zero{error average list size capacity C a` in terms of limits of suitable information resp. divergence quantities (Theorem 1). However, they don't \single{letterize". Next we assume that X Y and W(xjx) > 0 for all x 2 X , and we… (More)

Upper and lower bounds to the oblivious transfer (OT) capacity of discrete memoryless channels and multiple sources are obtained, for 1 of 2 strings OT with honest but curious participants. The upper bounds hold also for one-string OT. The results provide the exact value of OT capacity for a specified class of models, and the necessary and sufficient… (More)

We are concerned here with one of the oldest problems in combinatorial extremal theory. It is readily described after we have made a few conventions. ގ denotes the set of