4 research outputs found
Formally Unimodular Packings for the Gaussian Wiretap Channel
This paper introduces the family of lattice-like packings, which generalizes
lattices, consisting of packings possessing periodicity and geometric
uniformity. The subfamily of formally unimodular (lattice-like) packings is
further investigated. It can be seen as a generalization of the unimodular and
isodual lattices, and the Construction A formally unimodular packings obtained
from formally self-dual codes are presented. Recently, lattice coding for the
Gaussian wiretap channel has been considered. A measure called secrecy function
was proposed to characterize the eavesdropper's probability of correctly
decoding. The aim is to determine the global maximum value of the secrecy
function, called (strong) secrecy gain.
We further apply lattice-like packings to coset coding for the Gaussian
wiretap channel and show that the family of formally unimodular packings shares
the same secrecy function behavior as unimodular and isodual lattices. We
propose a universal approach to determine the secrecy gain of a Construction A
formally unimodular packing obtained from a formally self-dual code. From the
weight distribution of a code, we provide a necessary condition for a formally
self-dual code such that its Construction A formally unimodular packing is
secrecy-optimal. Finally, we demonstrate that formally unimodular
packings/lattices can achieve higher secrecy gain than the best-known
unimodular lattices.Comment: Accepted for publication in IEEE Transactions on Information Theory.
arXiv admin note: text overlap with arXiv:2111.0143
Construction of lattices for communications and security
In this thesis, we propose a new class of lattices based on polar codes, namely polar lattices. Polar lattices enjoy explicit construction and provable goodness for the additive white Gaussian noise (AWGN) channel, \textit{i.e.}, they are \emph{AWGN-good} lattices, in the sense that the error probability (for infinite lattice coding) vanishes for any fixed volume-to-noise ratio (VNR) greater than . Our construction is based on the multilevel approach of Forney \textit{et al.}, where on each level we construct a capacity-achieving polar code. We show the component polar codes are naturally nested, thereby fulfilling the requirement of the multilevel lattice construction. We present a more precise analysis of the VNR of the resultant lattice, which is upper-bounded in terms of the flatness factor and the capacity losses of the component codes. The proposed polar lattices are efficiently decodable by using multi-stage decoding. Design examples are presented to demonstrate the superior performance of polar lattices.
However, there is no infinite lattice coding in the practical applications. We need to apply the power constraint on the polar lattices which generates the polar lattice codes. We prove polar lattice codes can achieve the capacity \frac{1}{2}\log(1+\SNR) of the power-constrained AWGN channel with a novel shaping scheme. The main idea is that by implementing the lattice Gaussian distribution over the AWGN-good polar lattices, the maximum error-free transmission rate of the resultant coding scheme can be arbitrarily close to the capacity \frac{1}{2}\log(1+\SNR). The shaping technique is based on discrete lattice Gaussian distribution, which leads to a binary asymmetric channel at each level for the multilevel lattice codes. Then it is straightforward to employ multilevel asymmetric polar codes which is a combination of polar lossless source coding and polar channel coding. The construction of polar codes for an asymmetric channel can be converted to that for a related symmetric channel, and it turns out that this symmetric channel is equivalent to an minimum mean-square error (MMSE) scaled channel in lattice coding in terms of polarization, which eventually simplifies our coding design.
Finally, we investigate the application of polar lattices in physical layer security. Polar lattice codes are proved to be able to achieve the strong secrecy capacity of the Mod- AWGN wiretap channel. The Mod- assumption was due to the fact that a practical shaping scheme aiming to achieve the optimum shaping gain was missing. In this thesis, we use our shaping scheme and extend polar lattice coding to the Gaussian wiretap channel. By employing the polar coding technique for asymmetric channels, we manage to construct an AWGN-good lattice and a secrecy-good lattice with optimal shaping simultaneously. Then we prove the resultant wiretap coding scheme can achieve the strong secrecy capacity for the Gaussian wiretap channel.Open Acces
Secrecy gain, flatness factor, and secrecy-goodness of even unimodular lattices
International audienc
New Directions for Contact Integrators
Contact integrators are a family of geometric numerical schemes which
guarantee the conservation of the contact structure. In this work we review the
construction of both the variational and Hamiltonian versions of these methods.
We illustrate some of the advantages of geometric integration in the
dissipative setting by focusing on models inspired by recent studies in
celestial mechanics and cosmology.Comment: To appear as Chapter 24 in GSI 2021, Springer LNCS 1282