Related papers: On the MacWilliams Theorem over Codes and Lattices
Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…
We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…
Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
In the 1960s, MacWilliams proved that the Hamming weight enumerator of a linear code over a finite field completely determines, and is determined by, the Hamming weight enumerator of its dual code. In particular, if two linear codes have…
We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…
In "Self-adjoint Operators as Functions I: Lattices, Galois Connections, and the Spectral Order" [arXiv:1208.4724], it was shown that self-adjoint operators affiliated with a von Neumann algebra N can equivalently be described as certain…
We ascertain properties of the algebraic structures in towers of codes, lattices, and vertex operator algebras (VOAs) by studying the associated subobjects fixed by lifts of code automorphisms. In the case of sublattices fixed by subgroups…
A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…
Conditional identity in distribution (Berti et al. (2004)) is a new type of dependence for random variables, which generalizes the well-known notion of exchangeability. In this paper, a class of random sequences, called Generalized Species…
We extend Ravagnani's MacWilliams duality theory to the settings of rank metric codes over finite chain rings, relating the sequences of $q$-binomial moments of a rank metric code over this class of rings with those of its dual.
In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…
We present a detailed experimental study of the velocity distribution of atoms cooled in an optical lattice. Our results are supported by full-quantum numerical simulations. Even though the Sisyphus effect, the responsible cooling…
In $1991$, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei's duality theorem has since been extensively studied from different…
In the first part, we consider generalized quadratic Gauss sums as finite analogues of the Jacobi theta function, and the reciprocity law for Gauss sums as their transformation formula. We attach finite Dirichlet series to Gauss sums using…
We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical…
Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an $m$-spotty byte error, which can be…
The normal distribution is well-known for several results that it is the only to fulfil. The aim of the present paper is to show that many of these characterizations actually follow from the fact that the derivative of the log-density of…
We prove general superrigidity results for actions of irreducible lattices on CAT(0) spaces; first, in terms of the ideal boundary, and then for the intrinsic geometry (including for infinite-dimensional spaces). In particular, one obtains…
In this article we revisit smoothing bounds in parallel between lattices $and$ codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many…