Related papers: Sidon Sets, Difference Sets, and Codes in $ A_n $ …

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…

The groups of similarity and coincidence rotations of an arbitrary lattice L in d-dimensional Euclidean space are considered. It is shown that the group of similarity rotations contains the coincidence rotations as a normal subgroup.…

The question of list decoding error-correcting codes over finite fields (under the Hamming metric) has been widely studied in recent years. Motivated by the similar discrete structure of linear codes and point lattices in R^N, and their…

In this paper, we show that nested lattice codes achieve the capacity of arbitrary channels with or without non-casual state information at the transmitter. We also show that nested lattice codes are optimal for source coding with or…

A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…

In this paper, we study the symmetry of polar codes on symmetric binary-input discrete memoryless channels (B-DMC). The symmetry property of polar codes is originally pointed out in Arikan's work for general B-DMC channels. With the…

This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters…

A special class of Jordan algebras over a field $F$ of characteristic zero is considered. Such an algebra consists of an $r$-dimensional subspace of the vector space of all square matrices of a fixed order $n$ over $F$. It contains the…

The hull of a linear code over finite fields is the intersection of the code and its dual, and linear codes with small hulls have applications in computational complexity and information protection. Linear codes with the smallest hull are…

Sidon spaces have been introduced by Bachoc, Serra and Z\'emor as the $q$-analogue of Sidon sets, classical combinatorial objects introduced by Simon Szidon. In 2018 Roth, Raviv and Tamo introduced the notion of $r$-Sidon spaces, as an…

LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D' of lattices with one binary LDPC code as underlying code gives the well known…

The toric code is a simple and exactly solvable example of topological order realising Abelian anyons. However, it was shown to support non-local lattice defects, namely twists, which exhibit non-Abelian anyonic behaviour [1]. Motivated by…

In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We…

A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…

In the paper, we extend the ADC property to the representation of quadratic lattices by quadratic lattices, which we define as $ n $-ADC-ness. We explore the relationship between $ n$-ADC-ness, $ n $-regularity and $ n $-universality for…

Let $\mathcal{C} = (C_1, C_2, \ldots)$ be a sequence of codes such that each $C_i$ is a linear $[n_i,k_i,d_i]$-code over some fixed finite field $\mathbb{F}$, where $n_i$ is the length of the codewords, $k_i$ is the dimension, and $d_i$ is…

This paper provides a simplified proof for the existence of nested lattice codebooks allowing to achieve the capacity of the additive white Gaussian noise channel, as well as the optimal rate-distortion trade-off for a Gaussian source. The…

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…