English
Related papers

Related papers: Lattice Code Design for the Rayleigh Fading Wireta…

200 papers

We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with…

Information Theory · Computer Science 2017-05-09 Antonio Campello , Ling Liu , Cong Ling

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

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

We discuss the performance of polar codes, the capacity-achieving channel codes, on wireless communication channel in this paper. By generalizing the definition of Bhattacharyya Parameter in discrete memoryless channel, we present the…

Information Theory · Computer Science 2012-04-30 Peng Shi , Shengmei Zhao , Bei Wang

Recent results have shown that structured codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. For Gaussian channels with secrecy constraints, however, efforts to date rely…

Information Theory · Computer Science 2009-07-31 Xiang He , Aylin Yener

A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send a private and a confidential message that must be reliably…

Information Theory · Computer Science 2019-02-19 Jaume del Olmo Alos , Javier R. Fonollosa

Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…

Information Theory · Computer Science 2025-01-09 Jiajie Xue , Brian M. Kurkoski

Low density lattice codes (LDLC) are a family of lattice codes that can be decoded efficiently using a message-passing algorithm. In the original LDLC decoder, the message exchanged between variable nodes and check nodes are continuous…

Information Theory · Computer Science 2018-06-15 Shuiyin Liu , Yi Hong , Emanuele Viterbo , Alessia Marelli , Rino Micheloni

Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the…

Information Theory · Computer Science 2017-10-06 Jinwen Shi , Ling Liu , Deniz Gündüz , Cong Ling

We present a natural and low-complexity technique for achieving the capacity of the Gaussian relay network in the high SNR regime. Specifically, we propose the use of end-to-end structured lattice codes with the amplify-and-forward…

Information Theory · Computer Science 2013-09-17 Yun Xu , Edmund Yeh , Muriel Medard

Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but are also a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes…

Information Theory · Computer Science 2019-05-07 Paulo Ricardo Branco da Silva , Danilo Silva

We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a legitimate transmitter Alice is communicating with a legitimate receiver Bob in the presence of an eavesdropper Eve, and communication is done via MIMO channels. We…

Information Theory · Computer Science 2013-01-10 Jean-Claude Belfiore , Frédérique Oggier

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

Existing error correction mechanisms in lattice-based public key encryption (PKE) rely on either naive modulation or its concatenation with error correction codes (ECC). This paper shows that lattice coding, as a joint ECC and modulation…

Information Theory · Computer Science 2023-05-23 Shanxiang Lyu , Ling Liu , Cong Ling , Junzuo Lai , Hao Chen

Linear-assignment Gel'fand-Pinsker coding (LA-GPC) is a coding technique for channels with interference known only at the transmitter, where the known interference is treated as side-information (SI). As a special case of LA-GPC, dirty…

Information Theory · Computer Science 2011-06-28 Shih-Chun Lin , Pin-Hsun Lin , Chung-Pi Lee , Hsuan-Jung Su

The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying…

Information Theory · Computer Science 2017-04-04 P. K. Deekshith , K. R. Sahasranand

Rateless codes have been shown to provide robust error correction over a wide range of binary and noisy channels. Using a stochastic geometry model, this paper studies the performance of rateless codes in the cellular downlink and compares…

Information Theory · Computer Science 2017-02-27 Amogh Rajanna , Martin Haenggi

In this paper, we propose a polar coding scheme for secure communication over the multiple-input, single-output, single-antenna eavesdropper (MISOSE) fading channel. We consider the case of block fading channels with known eavesdropper…

Information Theory · Computer Science 2014-11-11 Mengfan Zheng , Meixia Tao , Wen Chen

A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send different confidential (and non-confidential) information to…

Information Theory · Computer Science 2019-09-12 Jaume del Olmo , Javier R. Fonollosa

We present a nested lattice-code-based strategy that achieves the random-coding based Compress-and-Forward (CF) rate for the three node Gaussian relay channel. To do so, we first outline a lattice-based strategy for the $(X+Z_1,X+Z_2)$…

Information Theory · Computer Science 2011-03-30 Yiwei Song , Natasha Devroye