Results 1 
4 of
4
Reliability of CalderbankShorSteane codes and security of quantum key distribution
 J. Phys. A: Math. Gen
, 2004
"... Abstract. After Mayers (1996, 2001) gave a proof of the security of the Bennett ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
(Show Context)
Abstract. After Mayers (1996, 2001) gave a proof of the security of the Bennett
Submitted to: New J. Phys.
, 2003
"... Abstract. Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the mathematically precise statements of this idea which hav ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the mathematically precise statements of this idea which have been put forward in the literature. We show that all the variations considered lead to equivalent capacity definitions. In particular, it makes no difference whether one requires mean or maximal errors to go to zero, and it makes no difference whether errors are required to vanish for any sequence of block sizes compatible with the rate, or only for one infinite sequence. PACS numbers: 03.67.Hk, 89.70.+c 1. Introduction, Outline