Related papers: Galaxy Codes: Advancing Achievability for Determin…
Coded caching is an information theoretic scheme to reduce high peak hours traffic by partially prefetching files in the users local storage during low peak hours. This paper considers heterogeneous decentralized caching systems where cache…
We consider the Gaussian channel with power constraint P. A gap exists between the channel capacity and the highest achievable rate of equiprobable uniformly spaced signal. Several approaches enable to overcome this limitation such as…
In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite dimensional Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the…
This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…
A long-standing problem on the classical capacity of bosonic Gaussian channels has recently been resolved by proving the minimum output entropy conjecture. It is also known that the ultimate capacity quantified by the Holevo bound can be…
Common randomness (CR), as a resource, is not commonly exploited in existing practical communication systems. In the CR generation framework, both the sender and receiver aim to generate a common random variable observable to both, ideally…
This paper examines the maximum code rate achievable by a data-driven communication system over some unknown discrete memoryless channel in the finite blocklength regime. A class of channel codes, called learning-based channel codes, is…
This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic…
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements from an underlying random process, code and transmit those…
This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…
Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach capacity, as…
We prove that, for all binary-input symmetric memoryless channels, polar codes enable reliable communication at rates within $\epsilon > 0$ of the Shannon capacity with a block length, construction complexity, and decoding complexity all…
We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show…
Sparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are universal, in the sense…
The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…
Motivated by applications in DNA-based data storage, constrained codes have attracted a considerable amount of attention from both academia and industry. We study the maximum cardinality of constrained codes for which the constraints can be…
In the classic wiretap model, Alice wishes to reliably communicate to Bob without being overheard by Eve who is eavesdropping over a degraded channel. Systems for achieving that physical layer security often rely on an error correction code…
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…
Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This work proposes a new paradigm, referred to as {\em many-user…
We study universal decoding over unknown discrete additive channels determined by a finite-state (unifilar) random process. Aiming at low-complexity decoders, we study variants of noise-guessing decoders that use estimators for the…