English
Related papers

Related papers: Polar Lattices for Strong Secrecy Over the Mod-$\L…

200 papers

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

This paper investigates polar codes for the additive white Gaussian noise (AWGN) channel. The scaling exponent $\mu$ of polar codes for a memoryless channel $q_{Y|X}$ with capacity $I(q_{Y|X})$ characterizes the closest gap between the…

Information Theory · Computer Science 2017-10-11 Silas L. Fong , Vincent Y. F. Tan

Almost all modern communication systems rely on electromagnetic fields as a means of information transmission, and finding the capacities of these systems is a problem of significant practical importance. The Additive White Gaussian Noise…

Quantum Physics · Physics 2013-02-05 Robert Koenig , Graeme Smith

Finding fast polarizing transforms is an important problem as polar codes suffer from slow finitelength performance. This paper considers non binary polar codes for transmission over the AWGN channel and designs polarizing transforms with…

Information Theory · Computer Science 2019-01-31 Sinan Kahraman

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate…

Quantum Physics · Physics 2025-12-18 Giuseppe Ortolano , Stefano Pirandola , Leonardo Banchi

A modification to 5G New Radio (NR) polar code is proposed, which improves the error correction performance with higher order modulation through probabilistic shaping. The presented scheme mainly re-uses existing hardware at the…

Information Theory · Computer Science 2018-08-29 Onurcan İşcan , Wen Xu

The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\i}kan proved that…

Information Theory · Computer Science 2014-12-16 Mine Alsan

Covert communication can prevent an adversary from knowing that a wireless transmission has occurred. In additive white Gaussian noise (AWGN) channels, a square root law is found that Alice can reliably and covertly transmit…

Cryptography and Security · Computer Science 2019-09-30 Zhihong Liu , Jiajia Liu , Yong Zeng , Jianfeng Ma

We consider the secret key capacity of the thermal loss channel, which is modeled by a beam splitter mixing an input signal mode with an environmental thermal mode. This capacity is the maximum value of secret bits that two remote parties…

In this paper, we study the connection between polar codes and product codes. Our analysis shows that the product of two polar codes is again a polar code, and we provide guidelines to compute its frozen set on the basis of the frozen sets…

Information Theory · Computer Science 2020-04-22 Carlo Condo , Valerio Bioglio , Hartmut Hafermann , Ingmar Land

We suggest a technique for the observation of a predicted supersolid phase in extended Bose-Hubbard models which are potentially realizable in cold atom optical lattice systems. In particular, we discuss important subtleties arising from…

Other Condensed Matter · Physics 2009-11-11 V. W. Scarola , E. Demler , S. Das Sarma

Consider the problem of constructing a polar code of block length $N$ for the transmission over a given channel $W$. Typically this requires to compute the reliability of all the $N$ synthetic channels and then to include those that are…

Information Theory · Computer Science 2017-07-17 Marco Mondelli , S. Hamed Hassani , Rüdiger Urbanke

Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the analysis and construction of polar codes involve the complex iterative-calculation. In…

Information Theory · Computer Science 2019-11-26 Kai Niu , Yan Li , Weiling Wu

Sparse superposition codes, or sparse regression codes, constitute a new class of codes which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are…

Information Theory · Computer Science 2018-11-12 Jean Barbier , Mohamad Dia , Nicolas Macris

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

This work establishes that the physical layer can be used to perform information-theoretic authentication in additive white Gaussian noise channels, as long as the adversary is not omniscient. The model considered consists of an encoder,…

Information Theory · Computer Science 2021-11-12 Eric Graves , Allison Beemer , Jorg Kliewer , Oliver Kosut , Paul Yu

The most natural way to describe an information-carrying system containing a specific noise is an additive white Gaussian-noise (AWGN) channel. In bosonic quantum systems (especially the Gaussian case), although the classical information…

Quantum Physics · Physics 2019-05-14 Kabgyun Jeong , Hun Hee Lee , Youngrong Lim

Polar codes are constructed based on the reliability of sub-channels resulting from the polarization effect. However, this information-theoretic construction approach leads to a poor weight distribution. To address this issue,…

Information Theory · Computer Science 2025-06-19 Mohammad Rowshan , Vlad-Florin Dragoi

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing…

Information Theory · Computer Science 2016-01-25 Wei Yang , Rafael F. Schaefer , H. Vincent Poor