Related papers: Sidon Sets, Difference Sets, and Codes in $ A_n $ …
A Sidon set is a subset of an Abelian group with the property that each sum of two distinct elements is distinct. We construct a small maximal Sidon set of size $O((n \cdot 2^n)^{1/3})$ in the group $\mathbb{Z}_2^n$, generalizing a result…
A Sidon sequence is a sequence of integers a_1 < a_2 < a_3 < ... with the property that the sums a_i+a_j (i\le j) are distinct. This work contains a survey of Sidon sequences and their generalizations, and an extensive annotated and…
We study whether an asymmetric limited-magnitude ball may tile $\mathbb{Z}^n$. This ball generalizes previously studied shapes: crosses, semi-crosses, and quasi-crosses. Such tilings act as perfect error-correcting codes in a channel which…
For a regular coupled cell network, synchrony subspaces are the polydiagonal subspaces that are invariant under the network adjacency matrix. The complete lattice of synchrony subspaces of an $n$-cell regular network can be seen as an…
Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This…
Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study of local testing for membership in lattices. Testing…
We consider a variety of settings involving chains with one or more defects stemming from the introduction of nodes bearing internal resonators. Motivated by experimental results in woodpile elastic lattices with one or two defects, we…
In this paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures,…
For many wiretap channel models asymptotically optimal coding schemes are known, but less effort has been put into actual realizations of wiretap codes for practical parameters. Bounds on the mutual information and error probability when…
In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - with linear-sized alphabets. More precisely, we prove that,…
The global $e$-$m$ exchange symmetry of the toric code is realized locally through an exactly solvable Hamiltonian on a two dimensional lattice which has no lattice dislocations and their associated defect line. The Hamiltonian is still…
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity $\frac{1}{2}\log(1+\SNR)$ of the additive white Gaussian-noise (AWGN) channel. Our construction follows the…
Grothendieck's theory of dessins provides a bridge between algebraic numbers and combinatorics. This paper adds a new concept, called 'bias', to the bridge. This produces: (i) from a biased plane tree the construction of a sequence of…
Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions…
We develop a classification of perfectly transmitting resonances occuring in effectively one-dimensional optical media which are decomposable into locally reflection symmetric parts. The local symmetries of the medium are shown to yield…
For some synchrotron light source beamline applications, a round beam is preferable to a flat one. A conventional method of obtaining round beam in an electron storage ring is to shift its tune close to a linear difference resonance. The…
We give new results on the structure and representations of the three lattices $\mathbf{\Lambda }_{\mathrm{k}},\mathbf{\Lambda }_{\mathrm{k}\mathcal{C}},\mathbf{\Lambda }_{\mathrm{k}}^{\ast }$ relevant to code CFTs realizing Narain…
Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…
Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…
Ribbons of two-dimensional lattices have properties depending sensitively on the morphology of the two edges. For regular ribbons with two parallel straight edges, the atomic chains terminating the two edges may have more than one choices…