The Single-Serving Channel Capacity
Published 1 July 2006
Renato Renner, Stefan Wolf, Jürg Wullschleger
Citations30
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The answer to the following question is provided: given a noisy channel PY|X and epsi > 0, how many bits can be transmitted with an error of at most epsI by a single use of the channel is provided.
Abstract
In this paper we provide the answer to the following question: given a noisy channel P Y|X and epsi > 0, how many bits can be transmitted with an error of at most epsi by a single use of the channel
Keywords
Computer ScienceEngineering
Bell System Technical JournalA Mathematical Theory of Communication
80,675 Citations1948Claude E. Shannon
Bell System Technical JournalThe Wire-Tap Channel
6,990 Citations1975A.D. Wyner
This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.
IEEE Transactions on Information TheoryNoiseless coding of correlated information sources
4,013 Citations1973D. Slepian, J.K. Wolf
The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
IEEE Transactions on Information TheoryBroadcast channels with confidential messages
3,378 Citations1978Imre Csiszár, János Körner
Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.
IEEE Transactions on Information TheorySecret key agreement by public discussion from common information
2,008 Citations1993Ueli Maurer
It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary symmetric channels, even when the enemy's channel is superior to the other two channels.
SIAM Journal on ComputingA Pseudorandom Generator from any One-way Function
1,677 Citations1999Johan Håstad, Russell Impagliazzo +2 more
It is shown how to construct a pseudorandom generator from any one-way function, and it is shown that there is a Pseudorandom Generator if and only ifthere is a one- way function.
IEEE Transactions on Information TheoryCommon randomness in information theory and cryptography. I. Secret sharing
1,339 Citations1993Rudolf Ahlswede, Imre Csiszár
As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, without letting an eavesdropper obtain information about this key) are considered.
SIAM Journal on ComputingPrivacy Amplification by Public Discussion
867 Citations1988Charles H. Bennett, Gilles Brassard +1 more
This paper investigates how the use of a channel with perfect authenticity but no privacy can be used to repair the defects of a channels with imperfect privacy but no authenticity.
Pseudo-random generation from one-way functions
710 Citations1989Russell Impagliazzo, Leonid A. Levin +1 more
From one-way functions of type (1) or (2) it is shown how to construct pseudo-random generators secure against small circuits or fast algorithms, respectively, and vice-versa.
IEEE Transactions on Information TheoryApproximation theory of output statistics
656 Citations1993Te Sun Han, Sergio Verdú
Lecture notes in computer scienceSimple and Tight Bounds for Information Reconciliation and Privacy Amplification
265 Citations2005Renato Renner, Stefan Wolf
It is shown that the two new quantities, and related notions, do not only extend Shannon entropy in the described contexts, but they also share central properties of the latter such as the chain rule as well as sub-additivity and monotonicity.
Smooth renyi entropy and applications
177 Citations2004Renato Renner, Stefan Wolf
A new entropy measure, called smooth Renyi entropy, is introduced, which characterizes fundamental properties of a random variable Z, such as the amount of uniform randomness that can be extracted from Z or the minimum length of an encoding of Z.
Physical Review ACommunication cost of entanglement transformations
72 Citations2003Patrick Hayden, Andreas Winter
A matching lower bound of the same asymptotic order is proved, demonstrating the optimality of the Lo-Popescu protocol up to a constant factor and establishing the existence of a fundamental asymmetry between the concentration and dilution tasks.
Manufacturing EngineerZero-error information and applications in cryptography
49 Citations2005Stefan Wolf, J. Wultschleger
It is shown that the new notion, together with two operators introduced in the same context, namely the common random variable of two random variables and the dependent part of a random variable with respect to another, is useful for giving characterizations of the possibility of realizing cryptographic tasks from correlated pieces of information.
Lecture notes in computer sciencePseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness
23 Citations2004Matthias Fitzi, Stefan Wolf +1 more
This paper considers the scenario where three players have access to random variables X, Y, and Z, respectively, and gives the exact condition on the joint distribution P XYZ under which unconditional broadcast is possible and shows that this condition characterizes the possibility of realizing so-called pseudo-signatures between the players.