# The Single-Serving Channel Capacity

@article{Renner2006TheSC, title={The Single-Serving Channel Capacity}, author={Renato Renner and Stefan Wolf and J{\"u}rg Wullschleger}, journal={2006 IEEE International Symposium on Information Theory}, year={2006}, pages={1424-1427} }

In this paper we provide the answer to the following question: 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

## Topics from this paper

## 31 Citations

Simple channel coding bounds

- Computer Science, Mathematics2009 IEEE International Symposium on Information Theory
- 2009

New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel using a quantity called the “smooth 0-divergence”, which is a generalization of Rényi's divergence of order 0.

One-shot capacity of discrete channels

- Computer Science, Mathematics2010 IEEE International Symposium on Information Theory
- 2010

This work gives a precise characterization of the one-shot capacity of discrete channels, defined as the maximum number of bits that can be transmitted in a single use of a channel with an error probability that does not exceed a prescribed value.

One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels

- Computer Science2018 IEEE International Symposium on Information Theory (ISIT)
- 2018

An achievable rate region is derived in the form of a tradeoff between public and private rates and converse bounds assessing the tightness of the achievable rates are provided.

Non-asymptotic information theoretic bound for some multi-party scenarios

- Mathematics, Computer Science2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2012

This work provides the one-shot rate region for the distributed source-coding (Slepian-Wolf) and the multiple-access channel and its asymptotic analysis yields a rate region which is equal to the rate region of the memoryless multiple- access channel in the limit of large number of channel uses.

Single-Serving Quantum Broadcast Channel With Common, Individualized, and Confidential Messages

- Computer ScienceIEEE Transactions on Information Theory
- 2020

An achievability region is provided, by proving a conditional version of the convex-split lemma combined with the position-based decoding, as well as a (weak) converse region, for the one-shot regime of a quantum broadcast channel with primary and third party receivers.

Generalized relative entropies and the capacity of classical-quantum channels

- Physics, Mathematics
- 2009

We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, which we…

On Capacity of Line Networks

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2007

It is proved that it is sufficient that the block length scales logarithmically with the network length in order to achieve any rate above the zero-error capacity, and it is shown that in many cases of interestLogarithmic growth is also necessary.

Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast Channel

- Computer Science, Mathematics2019 IEEE International Symposium on Information Theory (ISIT)
- 2019

An achievability region is found on the trade-off between the rates of the three messages and the source of randomness in the one-shot regime of a quantum broadcast channel.

One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2020

This work investigates the one-shot capabilities of a quantum channel for simultaneously transmitting bits and qubits in the asymptotic regime and finds achievable and converse bounds on the simultaneous transmission of the public and private classical information.

Noisy Channel Coding via Privacy Amplification and Information Reconciliation

- Mathematics, PhysicsIEEE Transactions on Information Theory
- 2011

We show that optimal protocols for noisy channel coding of public or private information over either classical or quantum channels can be directly constructed from two more primitive…

## References

SHOWING 1-10 OF 27 REFERENCES

Privacy Amplification by Public Discussion

- Computer ScienceSIAM J. Comput.
- 1988

In this paper, we investigate how the use of a channel with perfect authenticity but no privacy can be used to repair the defects of a channel with imperfect privacy but no authenticity. More preci...

The wire-tap channel

- Computer ScienceThe Bell System Technical Journal
- 1975

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.

A Mathematical Theory of Communication

- 2006

This paper opened the new area the information theory. Before this paper, most people believed that the only way to make the error probability of transmission as small as desired is to reduce the…

Broadcast channels with confidential messages

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 1978

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.

Approximation theory of output statistics

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 1993

The notion of resolvability of a channel is introduced, defined as the number of random bits required per channel use in order to generate an input that achieves arbitrarily accurate approximation of the output statistics for any given input process, and a general formula is obtained which holds regardless of the channel memory structure.

Common randomness in information theory and cryptography - I: Secret sharing

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 1993

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…

Zero-error information and applications in cryptography

- Mathematics, Computer ScienceInformation Theory Workshop
- 2004

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.

Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness

- Mathematics, Computer ScienceCRYPTO
- 2004

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.

Simple and Tight Bounds for Information Reconciliation and Privacy Amplification

- Mathematics, Computer ScienceASIACRYPT
- 2005

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.

Secret key agreement by public discussion from common information

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 1993

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 asymmetric channels, even when the enemy's channel is superior to the other two channels.