English
Related papers

Related papers: On the Achievable Rate and Capacity for a Sample-b…

200 papers

This paper provides an extensive study of the behavior of the best achievable rate (and other related fundamental limits) in variable-length lossless compression. In the non-asymptotic regime, the fundamental limits of fixed-to-variable…

Information Theory · Computer Science 2012-12-13 Ioannis Kontoyiannis , Sergio Verdu

We consider an energy-harvesting communication system where a transmitter powered by an exogenous energy arrival process and equipped with a finite battery of size $B_{max}$ communicates over a discrete-time AWGN channel. We first…

Information Theory · Computer Science 2015-01-12 Yishun Dong , Farzan Farnia , Ayfer Özgür

This letter investigates a novel wireless-powered quantum optical communication system, in which a batteryless quantum transmitter harvests energy from a classical radio-frequency source to transmit quantum coherent states. The transmission…

Information Theory · Computer Science 2025-09-10 Ioannis Krikidis

The quantum states of two laser pulses---coherent states---are never mutually orthogonal, making perfect discrimination impossible. Even so, coherent states can achieve the ultimate quantum limit for capacity of a classical channel, the…

Quantum Physics · Physics 2015-03-19 Jian Chen , Jonathan L. Habif , Zachary Dutton , Richard Lazarus , Saikat Guha

This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…

Information Theory · Computer Science 2018-12-17 Shota Saito , Hideki Yagi , Toshiyasu Matsushima

We prove that the ensemble the nested coset codes built on finite fields achieves the capacity of arbitrary discrete memoryless point-to-point channels. Exploiting it's algebraic structure, we develop a coding technique for communication…

Information Theory · Computer Science 2022-03-02 Arun Padakandla , Sandeep Pradhan

Motivated by recent developments in wireless power transfer, we study communication with a remotely powered transmitter. We propose an information-theoretic model where a charger can dynamically decide on how much power to transfer to the…

Information Theory · Computer Science 2016-12-12 Dor Shaviv , Ayfer Özgür , Haim H. Permuter

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…

Information Theory · Computer Science 2018-07-02 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

A practical communication channel often suffers from constraints on input other than the average power, such as the peak power constraint. In order to compare achievable rates with different constellations as well as the channel capacity…

Information Theory · Computer Science 2011-05-17 Shiro Ikeda , Kazunori Hayashi , Toshiyuki Tanaka

We analyze theoretically the impact of background counts on the efficiency of optical communication in the photon-starved regime using the pulse position modulation (PPM) format with direct detection. Degradation of the photon information…

Quantum Physics · Physics 2018-05-25 Marcin Jarzyna , Konrad Banaszek

We provide a simple method to obtain an upper bound on the secret key rate that is particularly suited to analyze practical realizations of quantum key distribution protocols with imperfect devices. We consider the so-called trusted device…

Quantum Physics · Physics 2009-11-11 Tobias Moroder , Marcos Curty , Norbert Lütkenhaus

We establish a domination principle for positive operators, which provides an upper bound on the essential spectral radius and yields quasi-compactness criteria on weighted supremum spaces with Lyapunov type functions and local domination.…

Probability · Mathematics 2026-01-12 Denis Villemonais

This paper introduces a novel information-theoretic approach for studying the effects of mutual coupling (MC), between the transmit and receive antennas, on the overall performance of single-input-single-output (SISO) near-field…

Information Theory · Computer Science 2021-12-13 Mohamed Akrout , Volodymyr Shyianov , Faouzi Bellili , Amine Mezghani , Robert W. Heath

We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state…

Information Theory · Computer Science 2017-05-24 Johan Östman , Giuseppe Durisi , Erik G. Ström

Capacity of M-ary Amplitude and Phase-Shift Keying(M-APSK) over an Additive White Gaussian Noise(AWGN) channel that also introduces an unknown carrier phase rotation is considered. The phase remains constant over a block of L symbols and it…

Information Theory · Computer Science 2007-07-13 Daniel C. Cunha , Jaime Portugheis

Impedance-matching networks affect power transfer from the radio frequency (RF) chains to the antennas. Their design impacts the signal to noise ratio (SNR) and the achievable rate. In this paper, we maximize the information-theoretic…

Information Theory · Computer Science 2023-10-17 Nitish Deshpande , Miguel R. Castellanos , Saeed R. Khosravirad , Jinfeng Du , Harish Viswanathan , Robert W. Heath

In this paper, we study information-theoretic limits for simultaneous wireless information and power transfer (SWIPT) systems employing a practical nonlinear radio frequency (RF) energy harvesting (EH) receiver. In particular, we consider a…

Information Theory · Computer Science 2017-11-06 Rania Morsi , Vahid Jamali , Derrick Wing Kwan Ng , Robert Schober

We derive an achievability bound to quantify the performance of a type-based unsourced multiple access system -- an information-theoretic model for grant-free multiple access with correlated messages. The bound extends available…

Information Theory · Computer Science 2025-04-29 Deekshith Pathayappilly Krishnan , Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi

The problem of lossless data compression with side information available to both the encoder and the decoder is considered. The finite-blocklength fundamental limits of the best achievable performance are defined, in two different versions…

Information Theory · Computer Science 2021-02-23 Lampros Gavalakis , Ioannis Kontoyiannis

We study the feasibility of meaningful proof-of-principle demonstrations of several quantum repeater protocols with photon (single-photon and photon-pair) sources and atomic-ensemble based quantum memories. We take into account non-unit…

Quantum Physics · Physics 2020-04-08 Yufeng Wu , Jianlong Liu , Christoph Simon
‹ Prev 1 3 4 5 6 7 10 Next ›