English
Related papers

Related papers: Second-Order Asymptotics for the Discrete Memoryle…

200 papers

Channel coding for discrete memoryless channels (DMCs) with mean and variance cost constraints has been recently introduced. We show that there is an improvement in coding performance due to cost variability, both with and without feedback.…

Information Theory · Computer Science 2025-07-10 Adeel Mahmood , Aaron B. Wagner

We study the second-order asymptotics of information transmission using random Gaussian codebooks and nearest neighbor (NN) decoding over a power-limited stationary memoryless additive non-Gaussian noise channel. We show that the dispersion…

Information Theory · Computer Science 2016-10-20 Jonathan Scarlett , Vincent Y. F. Tan , Giuseppe Durisi

We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically…

Information Theory · Computer Science 2017-01-13 Lan V. Truong , Vincent Y. F. Tan

Point processes are finding growing applications in numerous fields, such as neuroscience, high frequency finance and social media. So classic problems of classification and clustering are of increasing interest. However, analytic study of…

Statistics Theory · Mathematics 2025-01-29 Xinhui Rong , Victor Solo

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…

Information Theory · Computer Science 2018-12-07 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

The entanglement-assisted classical capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms…

Quantum Physics · Physics 2016-05-31 Nilanjana Datta , Marco Tomamichel , Mark M. Wilde

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of…

Information Theory · Computer Science 2008-12-31 Tal Philosof , Ram Zamir , Uri Erez

We propose two types of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast and we identify an…

Information Theory · Computer Science 2024-09-10 Masahito Hayashi

We introduce two variants of the information spectrum relative entropy defined by Tomamichel and Hayashi which have the particular advantage of satisfying the data-processing inequality, i.e. monotonicity under quantum operations. This…

Quantum Physics · Physics 2021-11-17 Nilanjana Datta , Felix Leditzky

Two decoder structures for coded modulation over the Gaussian and flat fading channels are studied: the maximum likelihood symbol-wise decoder, and the (suboptimal) bit-wise decoder based on the bit-interleaved coded modulation paradigm. We…

Information Theory · Computer Science 2014-04-23 Mikhail Ivanov , Alex Alvarado , Fredrik Brannstrom , Erik Agrell

We consider a basic communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends an encoded sequence to the receiver through a discrete memoryless channel, and the receiver is interested in…

Information Theory · Computer Science 2022-05-11 Han Wu , Hamdi Joudeh

The second-order coding rate of the multiple-input multiple-output (MIMO) quasi-static Rayleigh fading channel is studied. We tackle this problem via an information-spectrum approach and statistical bounds based on recent random matrix…

Information Theory · Computer Science 2016-11-17 Jakob Hoydis , Romain Couillet , Pablo Piantanida

A recent article on generalised linear mixed model asymptotics, Jiang et al. (2022), derived the rates of convergence for the asymptotic variances of maximum likelihood estimators. If $m$ denotes the number of groups and $n$ is the average…

Statistics Theory · Mathematics 2023-04-03 Luca Maestrini , Aishwarya Bhaskaran , Matt P. Wand

The goal of the paper is to study asymptotic behavior of the number of lost messages. Long messages are assumed to be divided into a random number of packets which are transmitted independently of one another. An error in transmission of a…

Probability · Mathematics 2007-05-23 Vyacheslav M. Abramov

We consider a multiple-input multiple-output (MIMO) multiple access channel (MAC), where the channel between each transmitter and the receiver is modeled by the doubly-scattering channel model. Based on novel techniques from random matrix…

Information Theory · Computer Science 2011-05-11 Jakob Hoydis , Romain Couillet , Merouane Debbah

The first terms of the low-signal-energy asymptotics for the mutual information in the discrete-time Poisson channel are derived and compared to an asymptotic expression of the capacity. In the presence of non-zero additive noise (either…

Information Theory · Computer Science 2008-08-21 Alfonso Martinez

In this paper, we consider a discrete memoryless point to point channel with noisy feedback, where there is a sender with a private message that she wants to communicate to a receiver by sequentially transmitting symbols over a noisy…

Systems and Control · Electrical Eng. & Systems 2020-02-25 Deepanshu Vasal

In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and…

Information Theory · Computer Science 2014-05-16 Andres Altieri , Leonardo Rey Vega , Pablo Piantanida , Cecilia G. Galarza

The generalized Poor-Verdu error lower bound for multihypothesis testing is revisited. Its asymptotic expression is established in closed-form as its tilting parameter grows to infinity. It is also shown that the asymptotic generalized…

Information Theory · Computer Science 2020-01-07 Ling-Hua Chang , Po-Ning Chen , Fady Alajaji , Yunghsiang S. Han
‹ Prev 1 3 4 5 6 7 10 Next ›