English
Related papers

Related papers: Lattice Codes Achieve the Capacity of Common Messa…

200 papers

In this paper, we propose a new approach to proving results regarding channel coding schemes based on construction-A lattices for the Additive White Gaussian Noise (AWGN) channel that yields new characterizations of the code construction…

Information Theory · Computer Science 2016-11-18 Wael Alghamdi , Walid Abediseid , Mohamed-Slim Alouini

Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as independent, identically distributed (i.i.d.) random Gaussian codebooks. Lattice codes are also known to outperform random codes…

Information Theory · Computer Science 2012-10-23 Yiwei Song , Natasha Devroye

A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a…

Information Theory · Computer Science 2016-08-24 Shashank Vatedka , Navin Kashyap

We propose a new coding scheme using only one lattice that achieves the $\frac{1}{2}\log(1+\SNR)$ capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, when the signal-to-noise ratio $\SNR>e-1$. The scheme…

Information Theory · Computer Science 2018-06-28 Cong Ling , Jean-Claude Belfiore

The index coding problem involves a sender with K messages to be transmitted across a broadcast channel, and a set of receivers each of which demands a subset of the K messages while having prior knowledge of a different subset as side…

Information Theory · Computer Science 2016-11-17 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…

Information Theory · Computer Science 2016-11-18 Jingge Zhu , Michael Gastpar

In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity $\frac{1}{2}\log(1+\SNR)$ of the additive white Gaussian-noise (AWGN) channel. Our construction follows the…

Information Theory · Computer Science 2018-10-16 Ling Liu , Yanfei Yan , Cong Ling , Xiaofu Wu

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good…

Information Theory · Computer Science 2017-12-27 Ling Liu , Yanfei Yan , Cong Ling

A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known…

Information Theory · Computer Science 2024-04-25 M. Yusuf Şener , Gerhard Kramer , Shlomo Shamai , Ronald Böhnke , Wen Xu

In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under…

Information Theory · Computer Science 2018-06-26 Antonio Campello , Daniel Dadush , Cong Ling

Lattice coding and decoding have been shown to achieve the capacity of the additive white Gaussian noise (AWGN) channel. This was accomplished using a minimum mean-square error scaling and randomization to transform the AWGN channel into a…

Information Theory · Computer Science 2013-08-08 Charles H. Swannack , Uri Erez , Gregory W. Wornell

Physical-layer network coding (PNC) is a communications paradigm that exploits overlapped transmissions to boost the throughput of wireless relay networks. A high point of PNC research was a theoretical proof that PNC that makes use of…

Networking and Internet Architecture · Computer Science 2017-08-23 Yihua Tan , Soung Chang Liew , Tao Huang

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…

Information Theory · Computer Science 2016-11-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

In the decades following Shannon's work, the quest to design codes for the additive white Gaussian noise (AWGN) channel led to the development of a rich theory, revealing a number of beautiful connections between information theory and…

Information Theory · Computer Science 2017-12-21 Laura Luzzi , Roope Vehkalahti

We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned…

Information Theory · Computer Science 2017-01-11 Antonio Campello , Cong Ling , Jean-Claude Belfiore

A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's…

Information Theory · Computer Science 2009-04-14 Tal Philosof , Ram Zamir , Uri Erez , Ashish Khisti

In this paper, we show that nested lattice codes achieve the capacity of arbitrary channels with or without non-casual state information at the transmitter. We also show that nested lattice codes are optimal for source coding with or…

Information Theory · Computer Science 2012-03-20 Aria G. Sahebi , S. Sandeep Pradhan

Recent results have shown that lattice codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. On the other hand, for Gaussian channels with secrecy constraints, efforts to…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. This list decoder is analogous to that used in random coding…

Information Theory · Computer Science 2010-10-04 Yiwei Song , Natasha Devroye

Lattices are deceptively simple mathematical structures that have become indispensable for code design for physical layer communications. While lattice-related problems are interesting in their own right, the usefulness of these discrete…

Information Theory · Computer Science 2017-06-21 Amaro Barreal
‹ Prev 1 2 3 10 Next ›