Results 51 to 60 of about 510,067 (72)

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

IEEE Transactions on Information 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 letting an eavesdropper obtain information about this key)
R. Ahlswede, I. Csiszár
semanticscholar   +1 more source

Information Theory and Statistics: A Tutorial

Foundations and Trends in Communications and Information Theory, 2004
This tutorial is concerned with applications of information theory concepts in statistics, in the finite alphabet setting. The information measure known as information divergence or Kullback-Leibler distance or relative entropy plays a key role, often ...
I. Csiszár, P. Shields
semanticscholar   +1 more source

Common Randomness in Information Theory and Cryptography - Part II: CR Capacity

IEEE Transactions on Information Theory, 1998
For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model.
R. Ahlswede, I. Csiszár
semanticscholar   +1 more source

Information Distance

IEEE Transactions on Information Theory, 1998
While Kolmogorov (1965) complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two pictures.
Charles H. Bennett, P. Gács, Ming Li, P. Vitányi, W. H. Zurek   +4 more
semanticscholar   +1 more source

Strong Converse Bounds in Quantum Network Information Theory

IEEE Transactions on Information Theory, 2021
In this paper, we develop the first method for finding strong converse bounds in quantum network information theory. The general scheme relies on a recently obtained result in the field of non-commutative functional inequalities, namely the tensorization
Hao-Chung Cheng, N. Datta, C. Rouzé
semanticscholar   +1 more source

Code Construction for Pliable Index Coding

International Symposium on Information Theory, 2019
A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S. Brahma, C. Fragouli, "Pliable index coding", IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 6192-6203, 2015]. In PICOD, we consider a
Shanuja Sasi, B. Rajan
semanticscholar   +1 more source

Optimal Index Codes for Some Interlinked Cycle Structures with Outer Cycles

International Symposium on Information Theory, 2019
For index coding problems with special structure on the side-information graphs called Interlinked Cycle (IC) structures index codes have been proposed in the literature (C. Thapa, L. Ong, and S.
Shanuja Sasi, B. Rajan
semanticscholar   +1 more source

Construction of Index Codes for Interlinked Cycle Structures with Outer Cycles

Global Communications Conference, 2018
Index code construction and decoding algorithm for side-information graphs called interlinked cycle (IC) structures, which generalize cycles and cliques, are given by Thapa, Ong and Johnson ("Interlinked Cycles for Index Coding: Generalizing Cycles and ...
K. V. Bharadwaj, B. Rajan
semanticscholar   +1 more source

Common randomness and secret key generation with a helper

Proceedings of IEEE International Symposium on Information Theory, 1997
Ahlswede-Csiszar (1993) and Csiszar (see Problemy Peredacii Informatsii, 1996) have addressed problems of determining the common randomness (CR) capacity and the secret key (SK) capacity for a variety of models as they arise in information theory and ...
I. Csiszár, P. Narayan
semanticscholar   +1 more source

An Algebraic and Probabilistic Framework for Network Information Theory

Foundations and Trends in Communications and Information Theory, 2020
In this monograph, we develop a mathematical framework based on asymptotically good random structured codes, i.e., codes possessing algebraic properties, for network information theory.
S. Pradhan, Arun Padakandla, Farhad Shirani   +2 more
semanticscholar   +1 more source