English
Related papers

Related papers: Leech Constellations of Construction-A Lattices

200 papers

We construct multilevel lattice codes from multiquadratic number fields for the compound block-fading wiretap channel. More precisely, we specialize Construction $\pi_A$ over the ring of integers $\mathcal{O}_K$ and exploit rational primes…

Information Theory · Computer Science 2026-04-15 Juliana G. F. Souza , Conghui Li , Cong Ling

We address noisy message-passing decoding of lowdensity parity-check (LDPC) codes over additive white Gaussian noise channels. Message-passing decoders in which certain processing units iteratively exchange messages are common for decoding…

Information Theory · Computer Science 2015-06-02 Alla Tarighati , Hamed Farhadi , Farshad Lahouti

Deep learning aided codes have been shown to improve code performance in feedback codes in high noise regimes due to the ability to leverage non-linearity in code design. In the additive white Gaussian broadcast channel (AWGN-BC), the…

Signal Processing · Electrical Eng. & Systems 2024-10-24 Jacqueline Malayter , Christopher Brinton , David Love

We develop a new transmission scheme for additive white Gaussian noisy (AWGN) channels based on Fuchsian groups from rational quaternion algebras. The structure of the proposed Fuchsian codes is nonlinear and nonuniform, hence conventional…

Information Theory · Computer Science 2014-10-28 Iván Blanco-Chacón , Dionís Remón , Camilla Hollanti , Montserrat Alsina

Multilevel lattice codes, such as those associated to Constructions $C$, $\overline{D}$, D and D', have relevant applications in communications. In this paper, we investigate some properties of lattices obtained via Constructions D and D'…

Information Theory · Computer Science 2024-02-14 Franciele do Carmo Silva , Ana Paula de Souza , Eleonesio Strey , Sueli I. R. Costa

For a lattice/linear code, we define the Voronoi spherical cumulative density function (CDF) as the CDF of the $\ell_2$-norm/Hamming weight of a random vector uniformly distributed over the Voronoi cell. Using the first moment method…

Information Theory · Computer Science 2026-03-02 Or Ordentlich

A genie-aided decoder for finite dimensional lattice codes is considered. The decoder may exhaustively search through all possible scaling factors $\alpha \in \mathbb{R}$. We show that this decoder can achieve lower word error rate (WER)…

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

This paper addresses the prediction of error floors of low-density parity-check (LDPC) codes with variable nodes of constant degree in the additive white Gaussian noise (AWGN) channel. Specifically, we focus on the performance of the…

Information Theory · Computer Science 2013-06-11 Brian K. Butler , Paul H. Siegel

We consider codes for channels with extreme noise that emerge in various low-power applications. Simple LDPC-type codes with parity checks of weight 3 are first studied for any dimension $m\rightarrow\infty.$ These codes form modulation…

Information Theory · Computer Science 2021-01-26 Ilya Dumer , Navid Gharavi

Low density generator matrix (LDGM) codes have an acceptable performance under iterative decoding algorithms. This idea is used to construct a class of lattices with relatively good performance and low encoding and decoding complexity. To…

Information Theory · Computer Science 2012-05-29 Hassan Mehri , Mohammad Reza Sadeghi

Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential encoding order of the accumulator. Simulations over additive…

Information Theory · Computer Science 2025-08-28 Diego Lentner , Thomas Wiegart , Richard D. Wesel

This paper introduces a novel framework for constructing algebraic lattices based on Construction-D, leveraging nested linear codes and prime ideals from algebraic number fields. We focus on the application of these lattices in block-fading…

Information Theory · Computer Science 2025-04-16 Maryam Sadeghi , Hassan Khodaiemehr , Chen Feng

We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the source and the adversary have power constraints $ P $ and $ N $…

Information Theory · Computer Science 2021-09-30 Yihan Zhang , Shashank Vatedka

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

In this paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The constructed codes are based on transversal designs that arise from…

Information Theory · Computer Science 2014-03-20 Alexander Gruner , Michael Huber

This paper considers the problem of code design for a channel where communications and radar systems coexist, modeled as having both Additive White Gaussian Noise (AWGN) and Additive Radar Interference (ARI). The issue of how to adapt or…

Information Theory · Computer Science 2019-04-12 Federico Brunero , Daniela Tuninetti , Natasha Devroye

Multidimensional Voronoi constellations (VCs) are shown to be more power-efficient than quadrature amplitude modulation (QAM) formats given the same uncoded bit error rate, and also have higher achievable information rates. However, a coded…

Information Theory · Computer Science 2023-08-02 S. Li , A. Mirani , M. Karlsson , E. Agrell

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…

Information Theory · Computer Science 2012-04-10 D. Kapetanovic , H. V. Cheng , W. H. Mow , F. Rusek

LDPC lattices were the first family of lattices that equipped with iterative decoding algorithms under which they perform very well in high dimensions. In this paper, we introduce quasi cyclic low density parity check (QC-LDPC) lattices as…

Information Theory · Computer Science 2016-03-24 Hassan Khodaiemehr , Mohammad-Reza Sadeghi , Amin Sakzad

This paper focuses on an improved Gaussian approximation (GA) based construction of polar codes with successive cancellation (SC) decoding over an additive white Gaussian noise (AWGN) channel. Arikan has proven that polar codes with…

Information Theory · Computer Science 2020-10-08 Hideki Ochiai , Patrick Mitran , H. Vincent Poor