English
Related papers

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

200 papers

This paper introduces a random modulation technique that is decoupled from the channel matrix, allowing it to be applied to arbitrary norm-bounded and spectrally convergent channel matrices. The proposed random modulation constructs an…

Information Theory · Computer Science 2026-01-01 Lei Liu , Yuhao Chi , Shunqi Huang

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…

Information Theory · Computer Science 2008-11-24 Vivek P. Mhatre , Catherine P. Rosenberg , Ravi R. Mazumdar

Several security models of multiple-access channel (MAC) are investigated. First, we study the degraded MAC with confidential messages, where two users transmit their confidential messages (no common message) to a destination, and each user…

Information Theory · Computer Science 2013-01-01 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

Sparse Regression Codes (SPARCs) are capacity-achieving codes introduced for communication over the Additive White Gaussian Noise (AWGN) channels and were later extended to general memoryless channels. In particular it was shown via…

Information Theory · Computer Science 2024-09-10 Yuhao Liu , Yizhou Xu , Tianqi Hou

In this paper, we study the finite blocklength limits of state-dependent discrete memoryless channels where the discrete memoryless state is known noncausally at the encoder. For the point-to-point case, this is known as the…

Information Theory · Computer Science 2013-11-13 Vincent Y. F. Tan

We consider a two-user state-dependent multiaccess channel in which only one of the encoders is informed, non-causally, of the channel states. Two independent messages are transmitted: a common message transmitted by both the informed and…

Information Theory · Computer Science 2016-11-18 Abdellatif Zaidi , Shiva Prasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

A determinantal approximation is obtained for the permanent of a doubly stochastic matrix. For moderate-deviation matrix sequences, the asymptotic relative error is of order $O(n^{-1})$.

Combinatorics · Mathematics 2012-05-28 Peter McCullagh

A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…

Information Theory · Computer Science 2025-06-19 Yao Liu , Min Li , An Liu , Lawrence Ong , Aylin Yener

We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each,…

Information Theory · Computer Science 2023-12-08 Gowtham R. Kurri , Viswanathan Ramachandran , Sibi Raj B. Pillai , Vinod M. Prabhakaran

In this paper, we revisit the discrete lossy Gray-Wyner problem. In particular, we derive its optimal second-order coding rate region, its error exponent (reliability function) and its moderate deviations constant under mild conditions on…

Information Theory · Computer Science 2017-01-05 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

A memoryless state-dependent broadcast channel (BC) is considered, where the transmitter wishes to convey two private messages to two receivers while simultaneously estimating the respective states via generalized feedback. The model at…

Information Theory · Computer Science 2020-11-09 Mehrasa Ahmadipour , Michèle Wigger , Mari Kobayashi

We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…

Information Theory · Computer Science 2023-06-06 Anina Gruica , Anna-Lena Horlemann , Alberto Ravagnani , Nadja Willenborg

This letter derives the asymptotic symbol error rate (SER) and outage probability of multiple-input multiple-output (MIMO) maximum ratio combining (MRC) systems. We consider Rayleigh fading channels with both transmit and receive spatial…

Information Theory · Computer Science 2009-11-11 Shi Jin , Matthew R. McKay , Xiqi Gao , Iain B. Collings

The second-order achievable asymptotics in typical random number generation problems such as resolvability, intrinsic randomness, fixed-length source coding are considered. In these problems, several researchers have derived the first-order…

Information Theory · Computer Science 2013-01-01 Ryo Nomura , Te Sun Han

This paper studies the third-order characteristic of nonsingular discrete memoryless channels and the Gaussian channel with a maximal-power constraint. The third-order term in our expansions employs a new quantity here called the channel…

Information Theory · Computer Science 2024-08-23 Recep Can Yavas , Victoria Kostina , Michelle Effros

A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor

We consider the classical sequential binary hypothesis testing problem in which there are two hypotheses governed respectively by distributions $P_0$ and $P_1$ and we would like to decide which hypothesis is true using a sequential test. It…

Information Theory · Computer Science 2020-07-01 Yonglong Li , Vincent Y. F. Tan

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

The first- and second-order optimum achievable exponents in the simple hypothesis testing problem are investigated. The optimum achievable exponent for type II error probability, under the constraint that the type I error probability is…

Information Theory · Computer Science 2018-04-04 Te Sun Han , Ryo Nomura