Related papers: An Assmus-Mattson theorem for codes over commutati…
We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, namely, constant-composition codes, nonbinary constant-weight codes and multiply constant-weight codes. This was achieved via an…
We show that the topes of a complex of oriented matroids (abbreviated COM) of VC-dimension $d$ admit a proper labeled sample compression scheme of size $d$. This considerably extends results of Moran and Warmuth on ample classes, of…
We introduce a code construction for Wess-Zumino-Witten (WZW) models associated with simply-laced affine Lie algebras at level 1. The chiral primary fields of these rational CFTs can be parametrized by the elements of the outer automorphism…
In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are…
We generalize the fundamental bounds of Delsarte thesis (1973) on codes of given degree and designs of given strength in the new setting of Bannai et al. (2025). We assume the scheme is weakly metric in the sense of (Sol\'e, 1989). We give…
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the…
We apply the general theory of tensor products of modules for a vertex operator algebra developed in our papers hep-th/9309076, hep-th/9309159, hep-th/9401119, q-alg/9505018, q-alg/9505019 and q-alg/9505020 to the case of the…
We first summarize the basic structure of the outer distribution module of a completely regular code. Then, employing a simple lemma concerning eigenvectors in association schemes, we propose to study the tightest case, where the indices of…
It is a long-standing conjecture that any CFT with a large central charge and a large gap $\Delta_{\text{gap}}$ in the spectrum of higher-spin single-trace operators must be dual to a local effective field theory in AdS. We prove a sharp…
In this paper, the MacWilliams theorem is stated for codes over finite field with four-dimensional modulo metrics.
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…
We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…
Linear codes with few weights have been a significant area of research in coding theory for many years, due to their applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. Inspired by…
Tensor-based modulation (TBM) provides a multi-linear spreading framework for blind multi-user separation in unsourced random access. In this paper, we show that TBM is a coded modulation built on a non-binary linear block code over…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…
We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…
Delsarte theory, more specifically the study of codes and designs in association schemes, has proved invaluable in studying an increasing assortment of association schemes in recent years. Tools motivated by the study of error-correcting…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
A description of complete normal varieties with lower dimensional torus action has been given by Altmann, Hausen, and Suess, generalizing the theory of toric varieties. Considering the case where the acting torus T has codimension one, we…