相关论文: Random Ensembles of Lattices from Generalized Redu…
Let $\omega=(-1+\sqrt{-3})/2$. For any lattice $P\subseteq \mathbb{Z}^n$, $\mathcal{P}=P+\omega P$ is a subgroup of $\mathcal{O}_K^n$, where $\mathcal{O}_K=\mathbb{Z}[\omega]\subseteq \mathbb{C}$. As $\mathbb{C}$ is naturally isomorphic to…
An upper bound on the error probability of specific lattices, based on their distance-spectrum, is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers.…
In this paper, using compute-and-forward as an example, we provide an overview of constructions of lattices from codes that possess the right algebraic structures for harnessing interference. This includes Construction A, Construction D,…
Lattices of compatibly embedded finite fields are useful in computer algebra systems for managing many extensions of a finite field $\mathbb{F}_p$ at once. They can also be used to represent the algebraic closure $\bar{\mathbb{F}}_p$, and…
New series of $2^{2m}$-dimensional universally strongly perfect lattices $\Lambda_I $ and $\Gamma_J $ are constructed with $$2BW_{2m} ^{\#} \subseteq \Gamma _J \subseteq BW_{2m} \subseteq \Lambda _I \subseteq BW _{2m}^{\#} .$$ The lattices…
We review various combinatorial applications of field theoretical and matrix model approaches to equilibrium statistical physics involving the enumeration of fixed and random lattice model configurations. We show how the structures of the…
Approximate lattices of Euclidean spaces, also known as Meyer sets, are aperiodic subsets with fascinating properties. In general, approximate lattices are defined as approximate subgroups of locally compact groups that are discrete and…
In this paper, we give a method for constructing linear codes with small hulls by generalizing the method in \cite{LCD-T-matric}. As a result, we obtain many optimal Euclidean LCD codes and Hermitian LCD codes, which improve the previously…
We announce results about the structure and arithmeticity of all possible lattice embeddings of a class of countable groups which encompasses all linear groups with simple Zariski closure, all groups with non-vanishing first l2-Betti…
In order to understand the performance of a code under maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first…
Spacetimes obtained by dimensional reduction along lattices containing a lightlike direction can admit semigroup extensions of their isometry groups. We show by concrete examples that such a semigroup can exhibit a natural order, which in…
In 1973, Gallager proved that the random-coding bound is exponentially tight for the random code ensemble at all rates, even below expurgation. This result explained that the random-coding exponent does not achieve the expurgation exponent…
It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We…
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…
Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…
We lift important results about universally typical sets, typically sampled sets, and empirical entropy estimation in the theory of samplings of discrete ergodic information sources from the usual one-dimensional discrete-time setting to a…
We provide and motivate in this paper a natural framework for the study of approximate lattices. Namely, we consider approximate lattices in so-called $S$-adic linear groups and define relevant notions of arithmeticity. We also adapt to…