Journal: IEEE Transactions on Information Theory

Loading...

Abbreviation

IEEE trans. inf. theory

Publisher

IEEE

Journal Volumes

ISSN

0018-9448
1557-9654

Description

Search Results

Publications 1 - 10 of 184
  • Key Recycling in Authentication
    Item type: Journal Article
    Portmann, Christopher (2014)
    IEEE Transactions on Information Theory
  • Lapidoth, Amos; Wang, Ligong; Yan, Yiming (2025)
    IEEE Transactions on Information Theory
    The capacity of a state-dependent discrete memoryless channel is derived for the setting where a message-cognizant rate-limited helper observes the state sequence noncausally and provides its description to both encoder and decoder. Said capacity is not increased if the channel outputs are fed back to the encoder via a noiseless feedback link. The analogous capacity is derived for the Gaussian channel, where the state corresponds to the additive noise. In this setting the feedback link - while not increasing capacity - eliminates the need for the helper's cognition of the transmitted message. Moreover, in this setting, the results on capacity also hold for the cutoff rate and the listsize capacity.
  • Kim, Young-Han; Lapidoth, Amos; Weissman, Tsachy (2011)
    IEEE Transactions on Information Theory
  • Arnold, Dieter M.; Loeliger, Hans-Andrea; Vontobel, Pascal O.; et al. (2006)
    IEEE Transactions on Information Theory ~ 2003 IEEE international symposium on information theory
  • Lapidoth, Amos; Shapiro, Jeffrey H.; Venkatesan, Vinodh; et al. (2011)
    IEEE Transactions on Information Theory
  • Studer, Christoph; Boelcskei, Helmut (2010)
    IEEE Transactions on Information Theory
  • Koenig, Robert; Renner, Renato (2011)
    IEEE Transactions on Information Theory
  • Renes, Joseph M.; Sutter, David; Dupuis, Frédéric; et al. (2015)
    IEEE Transactions on Information Theory
  • Duality of Channels and Codes
    Item type: Journal Article
    Renes, Joseph M. (2018)
    IEEE Transactions on Information Theory
  • Bouette, Cécile; Luzzi, Laura; Wang, Ligong (2025)
    IEEE Transactions on Information Theory
    We study the fundamental limits of covert communications over general memoryless additive-noise channels. We assume that the legitimate receiver and the eavesdropper share the same channel and therefore see the same outputs. Under mild integrability assumptions, we find a general upper bound on the square-root scaling constant, which only involves the variance of the logarithm of the probability density function of the noise. Furthermore, we show that, under some additional assumptions, this upper bound is tight. We also provide upper bounds on the length of the secret key required to achieve the optimal scaling.
Publications 1 - 10 of 184