相关论文: Few-cosine spherical codes and Barnes-Wall lattice…

We show that the partition function of the super eigenvalue model satisfies an infinite set of constraints with even spins $s=4,6,\cdots,\infty$. These constraints are associated with half of the bosonic generators of the super $\left(…

In this article, we show that the minimal vectors of the extremal even unimodular lattices in $\mathbb{R}^{32}$ are $T$-avoiding universally optimal for suitable sets $T$. Moreover, they are minimal $T$-avoiding spherical designs and…

We consider the problem of constructing deletion correcting codes over a binary alphabet and take a graph theoretic view. An $n$-bit $s$-deletion correcting code is an independent set in a particular graph. We propose constructing such a…

Creating accurate and low-noise covariance matrices represents a formidable challenge in modern-day cosmology. We present a formalism to compress arbitrary observables into a small number of bins by projection into a model-specific subspace…

We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…

We review the mathematical tools required to cull and filter representations of the Coxeter Group $BC_4$ into providing bases for the construction of minimal off-shell representations of the 4D, $ {\cal N}$ = 1 spacetime supersymmetry…

Low-density parity-check (LDPC) codes have been the subject of much interest due to the fact that they can perform near the Shannon limit. In this paper we present a construction of LDPC codes from cubic symmetric graphs. The constructed…

We study learnable logic gate networks that stack layers of 2-input Boolean gates to build combinational circuits. Every 2-input gate has a unique multilinear polynomial with 4 coefficients, so the 16 Boolean gates form a codebook of…

Recent advancements in the synthesis of anisotropic macromolecules and nanoparticles have spurred an immense interest in theoretical and computational studies of self-assembly. The cornerstone of such studies is the role of shape in…

The perfect space-time block codes (STBCs) are based on four design criteria - full-rateness, non-vanishing determinant, cubic shaping and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at…

A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…

Cyclic codes have efficient encoding and decoding algorithms over finite fields, so that they have practical applications in communication systems, consumer electronics and data storage systems. The objective of this paper is to give eight…

High-rate bivariate bicycle (BB) codes are promising low-overhead quantum memories, but their stabilizer checks typically have weight $6$ or higher, making syndrome extraction challenging. We introduce subsystem bivariate bicycle (SBB)…

We describe odd-length-cube tilings of the n-dimensional q-ary torus what includes q-periodic integer lattice tilings of R^n. In the language of coding theory these tilings correspond to perfect codes with respect to the maximum metric. A…

We construct bosonic and fermionic matrix-vector models which describe orbifolded string worldsheets at a limit in which the dimension of the vector space and the matrix order are taken to infinity. We evaluate tree-level one-loop or…

We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…

Inversive geometry can be used to generate exactly self-similar space-filling sphere packings. We present a construction method in two dimensions and generalize it to search for packings in higher dimensions. We newly discover 29…

We introduce a conceptually simple and efficient algorithm for seamless parametrization, a key element in constructing quad layouts and texture charts on surfaces. More specifically, we consider the construction of parametrizations with…

We consider lattices generated by finite Abelian groups. We prove that such a lattice is strongly eutactic, which means the normalized minimal vectors of the lattice form a spherical 2-design, if and only if the group is of odd order or if…

We prove an Assmus-Mattson-type theorem for block codes where the alphabet is the vertex set of a commutative association scheme (say, with $s$ classes). This in particular generalizes the Assmus-Mattson-type theorems for…