Absrfucr-Given two discrete memoryless channels @MC’s) with a common input, it is desired to transmit private messagea to receiver 1 at r&R, andcommon meswgea to both receivers at rate R,, while… (More)

We derive single-letter characterizations of (strong) secrecy capacities for models with an arbitrary number of terminals, each of which observes a distinct component of a discrete memoryless… (More)

A/~~stract-For Slepian-Wolf source networks, the error exponents obtained by Kiirner, Marton, and the author are shown to be universally attainable by linear codes alsa. Improved exponents are… (More)

A well-known result of Ahlswede asserts that the deterministic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code… (More)

The title of this book is rather misleading, for less than half of it is devoted to an introductory treatment of basic concepts of information theory. The rest is advanced material, not surprisingly… (More)

We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a “helper” terminal. Each terminal observes a different component of a discrete… (More)

The method of types is one of the key technical tools in Shannon Theory, and this tool is valuable also in other fields. In this paper, some key applications will be presented in sufficient detail… (More)