English
Related papers

Related papers: Construction $\pi_A$ and $\pi_D$ Lattices: Constru…

200 papers

Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes.…

Information Theory · Computer Science 2017-10-16 Somphong Jitman , Todsapol Mankean

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

In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such…

Information Theory · Computer Science 2013-04-11 Walid Abediseid , Mohamed-Slim Alouini

In this work, we investigate additive complementary dual (ACD) codes and their construction over finite fields $\mathbb{F}_{q^2}$ with respect to the trace inner products, where $q$ is a prime power. First, we associate an additive code…

Information Theory · Computer Science 2025-10-21 Gyanendra K. Verma , R. K. Sharma

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

Category Theory · Mathematics 2010-12-10 Pierre Gillibert

In this paper, we address the design of high spectral-efficiency Barnes-Wall (BW) lattice codes which are amenable to low-complexity decoding in additive white Gaussian noise (AWGN) channels. We propose a new method of constructing complex…

Information Theory · Computer Science 2013-01-09 J. Harshan , Emanuele Viterbo , Jean-Claude Belfiore

Recent lattice calculations of hadron structure functions are described.

High Energy Physics - Lattice · Physics 2008-11-26 M. Goeckeler , R. Horsley , E. -M. Ilgenfritz , H. Perlt , P. Rakow , G. Schierholz , A. Schiller

Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from…

Information Theory · Computer Science 2017-01-03 Hassan Khodaiemehr , Dariush Kiani

Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…

Number Theory · Mathematics 2024-02-23 Aafko Boonstra , Charlene Kalle

Using an algebraic approach based on the theory of Coxeter groups, we design, and describe the performance of, a class of line codes for parallel transmission of $b$ bits over $b+1$ wires that admit especially simple encoding and decoding…

Information Theory · Computer Science 2017-07-28 Ezio Biglieri , Emanuele Viterbo

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

In this paper, we design polar codes and polar lattices for i.i.d. fading channels when the channel state information is only available to the receiver. For the binary input case, we propose a new design of polar codes through single-stage…

Information Theory · Computer Science 2016-02-08 Ling Liu , Cong Ling

We propose a new method for constructing small-bias spaces through a combination of Hermitian codes. For a class of parameters our multisets are much faster to construct than what can be achieved by use of the traditional algebraic…

Commutative Algebra · Mathematics 2012-08-01 Olav Geil , Stefano Martin , Ryutaroh Matsumoto

We propose a technique to design finite-length irregular low-density parity-check (LDPC) codes over the binary-input additive white Gaussian noise (AWGN) channel with good performance in both the waterfall and the error floor region. The…

Information Theory · Computer Science 2016-11-17 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari

An important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths $n$. In this paper, we address this question for specific values of $n$. First, we investigate the existence of…

Combinatorics · Mathematics 2025-10-16 S. A. Mane , N. V. Shinde

In this article, we study new methods for constructing uninorms on bounded lattices. First, we present new methods for constructing uninorms on bounded lattices under the additional constraints and prove that some of these constraints are…

Rings and Algebras · Mathematics 2022-09-07 Z. -Y. Xiu , Y. -X. Jiang

Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…

Information Theory · Computer Science 2019-06-17 Homa Esfahanizadeh , Ruiyi Wu , Lara Dolecek

Spatially-coupled low-density lattice codes (LDLC) are constructed using protographs. Using Monte Carlo density evolution using single-Gaussian messages, we observe that the threshold of the spatially-coupled LDLC is within 0.22 dB of…

Information Theory · Computer Science 2011-07-26 Hironori Uchikawa , Brian M. Kurkoski , Kenta Kasai , Kohichi Sakaniwa

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…

Information Theory · Computer Science 2023-09-29 Maiara F. Bollauf , Hsuan-Yin Lin , Øyvind Ytrehus

The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From these bounds, it is explicit that both the information leakage…

Information Theory · Computer Science 2020-07-31 Mohamed Taoufiq Damir , Alex Karrila , Laia Amorós , Oliver Gnilke , David Karpuk , Camilla Hollanti