English
Related papers

Related papers: 2- and 3-modular Lattice Wiretap Codes in Small Di…

200 papers

Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian…

Information Theory · Computer Science 2017-12-19 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

One key metric for physical layer security is the secrecy capacity. This is the maximum rate that a system can transmit with perfect secrecy. For a Multiple Input Multiple Output (MIMO) system (a newer technology for 5G, 6G and beyond) the…

Information Theory · Computer Science 2022-10-03 Jennifer Chakravarty , Oliver Johnson , Robert Piechocki

We consider a fading wiretap channel model where the transmitter has only statistical channel state information, and the legitimate receiver and eavesdropper have perfect channel state information. We propose a sequence of non-random…

Information Theory · Computer Science 2016-11-18 Laura Luzzi , Cong Ling , Roope Vehkalahti

The theta series of a lattice is a power series that characterizes the number of lattice vectors at certain norms. It is closely related to a critical quantity widely used in physical layer security and cryptography, known as the flatness…

Metric Geometry · Mathematics 2025-09-05 Maiara F. Bollauf , Hsuan-Yin Lin

We study the problem of two-user Gaussian multiple access channel (GMAC) in the presence of an external eavesdropper. In this problem, an eavesdropper receives a signal with a lower signal-to-noise ratio (SNR) compared to the legitimate…

Information Theory · Computer Science 2018-01-19 Sahar Shahbaz , Bahareh Akhbari , Reza Asvadi

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…

Information Theory · Computer Science 2016-04-07 Xiaolu Hou , Frédérique Oggier

Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on…

Information Theory · Computer Science 2015-09-15 Hiroyuki Endo , Te Sun Han , Takao Aoki , Masahide Sasaki

In this work, we prove that a positive secure degree of freedom is achievable for a large class of Gaussian channels as long as the channel is not degraded and the channel is fully connected. This class includes the MAC wire-tap channel,…

Information Theory · Computer Science 2016-11-17 Xiang He , Aylin Yener

Consider the Gaussian wiretap channel, where a transmitter wishes to send a confidential message to a legitimate receiver in the presence of an eavesdropper. It is well known that if the eavesdropper experiences less channel noise than the…

Information Theory · Computer Science 2026-01-29 Vidhi Rana , Remi A. Chou , Taejoon Kim

In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…

Information Theory · Computer Science 2012-08-27 Peng Xu , Zhiguo Ding , and Xuchu Dai , Kin Leung

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under a peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

Information Theory · Computer Science 2023-05-17 Antonino Favano , Luca Barletta , Alex Dytso

The concept of well-rounded lattices has recently found important applications in the setting of a fading single-input single-output (SISO) wiretap channel. It has been shown that, under this setup, the property of being well-rounded is…

Information Theory · Computer Science 2016-09-27 Oliver W. Gnilke , Amaro Barreal , Alex Karrila , Ha Thanh Nguyen Tran , David A. Karpuk , Camilla Hollanti

The highest possible minimal norm of a unimodular lattice is determined in dimensions n <= 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8*10^20 in dimension 33).…

Combinatorics · Mathematics 2007-05-23 J. H. Conway , N. J. A. Sloane

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

A belief-propagation decoder for low-density lattice codes is given which represents messages explicitly as a mixture of Gaussians functions. The key component is an algorithm for approximating a mixture of several Gaussians with another…

Information Theory · Computer Science 2009-05-01 Brian M. Kurkoski , Justin Dauwels

Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…

Information Theory · Computer Science 2016-11-17 Yiwei Song , Natasha Devroye , Huai-Rong Shao , Chiu Ngo

We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…

Combinatorics · Mathematics 2019-02-26 Jukka Kohonen

Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional…

Information Theory · Computer Science 2007-07-13 Naftali Sommer , Meir Feder , Ofir Shalvi

From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new…

Information Theory · Computer Science 2010-10-06 Masahito Hayashi , Ryutaroh Matsumoto

InGaN light-emitting diodes (LEDs) are more efficient and cost effective than incandescent and fluorescent lighting, but lattice mismatch limits the thickness of InGaN layers that can be grown on GaN without performance-degrading…

Applied Physics · Physics 2019-08-05 Kevin P. Greenman , Logan Williams , Emmanouil Kioupakis