The single-serving channel capacity

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1424-1427

  Renner, Renato ^a   Wolf, Stefan ^b   Wullschleger, Jürg ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

NOISY CHANNEL; SINGLE-SERVING CHANNEL CAPACITY;

BIT ERROR RATE; CHANNEL CODING; CHANNEL ESTIMATION; GAUSSIAN NOISE (ELECTRONIC);

CHANNEL CAPACITY;

EID: 36348946178     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.262081     Document Type: Conference Paper

References (17)

1. R. Ahlswede and I. Csiszár. Common randomness in information theory and cryptography - part I: Secret sharing. IEEE Transactions on Information Theory. 39(4): 1121-1132, 1993.
2. C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing, 17(2):210-229, 1988.
3. I. Csiszar and J. Körner. Broadcast channels with confidential messages. IEEE Transactions on Information Theory, 24(3):339-348, 1978.
4. M. Fitzi, S. Wolf, and J. Wullschleger. Pseudo-signatures, broadcast, and multi-party computation from correlated randomness. In Advances in Cryptology-CRYPTO '04. Springer-Verlag, 2004.
5. P. Gacs and J. Körner. Common information is far less than mutual information. Probl. Contr. Inform. Theory. 2:149-162, 1973.
6. T. S. Han, S. Verdú. Approximation Theory of Output Statistics. IEEE Trans. on Information Theory, vol. IT-39, no. 3, pp. 752-772, 1993.
7. P. Hayden and A. Winter. On the communication cost of entanglement transformations. Phys. Rev. A. 67:012326, 2003.
8. J. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
9. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC '89). pages 12-24. ACM Press, 1989.
10. U. Maurer. Secret key agreement by public discussion. IEEE Transaction on Information Theory, 39(3):733-742, May 1993.
11. R. Renner. Security of QKD. PhD thesis, ETH, 2005, quant-ph/0512258.
12. R. Renner and S. Wolf. Smooth Rényi entropy and applications. In Proceedings of 2004 IEEE International Symposium on Information Theory, page 233. IEEE, June 2004.
13. R. Renner and S. Wolf. Simple and tight bounds for information reconciliation and privacy amplification. In Advances in Cryptology-ASIACRYPT 2005. volume 3788, pages 199-216. Springer-Verlag, December 2005.
14. C. E. Shannon. A mathematical theory of communication. Bell System Tech. Journal. 27:379-423, 623-656, 1948.
15. D. Slepian and J. K. Wolf. Noiseless coding of correlated information sources. IEEE Transactions on Information Theory. IT-19:471-480, 1973.
16. S. Wolf and J. Wullschleger. Zero-error information and applications in cryptography. In Proceedings of 2004 IEEE Information Theory Workshop (ITW 2004). 2004.
17. A. D. Wyner. The wiretap channel. Bell System Tech. Journal, 54:1355-1387, 1975.