Related papers: A note on the Assmus--Mattson theorem for some bin…
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…
We argue that some features of the standard model, in particular the fermion assignment and symmetry breaking, can be obtained in matrix model which describes noncommutative gauge theory as well as gravity in an emergent way. The mechanism…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
We generalize the Gleason-Kahane-\.Zelazko theorem to modules. As an application, we show that every linear functional on a Hardy space that is non-zero on outer functions is a multiple of a point evaluation. A further consequence is that…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
We generalize the dual notions of "expansion" and "collapse" so they can be applied to arbitrary metric spaces. We also expand the theory to allow for infinitely many such moves. Those tools are then employed to prove a variety of…
This work represents a natural coalescence of two important lines of work: learning mixtures of Gaussians and algorithmic robust statistics. In particular we give the first provably robust algorithm for learning mixtures of any constant…
We prove that the coefficients of certain weight -1/2 harmonic Maass forms are traces of singular moduli for weak Maass forms. To prove this theorem, we construct a theta lift from spaces of weight -2 harmonic weak Maass forms to spaces of…
We investigate $p$-ary $t$-designs which are simultaneously designs for all $t$, which we call universal $p$-ary designs. Null universal designs are well understood due to Gordon James via the representation theory of the symmetric group.…
Nonlinear sigma models arise in supergravity theories with or without matter couplings in various dimensions and they are important in understanding the duality symmetries of M-theory. With this motivation in mind, we review the salient…
Our aim in this paper is to prove some interesting fixed point theorems for the class of asymptotically $T$-regular mappings in the framework of preordered modular G-metric spaces. Our results are novel and generalizes several know results.…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
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…
Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…
We derive a few extended versions of the Kraft inequality for lossy compression, which pave the way to the derivation of several refinements and extensions of the well known Shannon lower bound in a variety of instances of rate-distortion…
We present a unified and completely general formulation of extended geometry, characterised by a Kac-Moody algebra and a highest weight coordinate module. Generalised diffeomorphisms are constructed, as well as solutions to the section…
Reconsideration of the T-duality of the open string allows us to introduce some geometric features in non-geometric theories. First, we have found what symmetry is T-dual to the local gauge transformations. It includes transformations of…
This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic…
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…