Related papers: A note on the Singleton bounds for codes over fini…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
We prove superpolynomial length lower bounds for the semantic tree-like Frege refutation system with bounded line size. Concretely, for any function $n^{2-\varepsilon} \leq s(n) \leq 2^{n^{1-\varepsilon}}$ we exhibit an explicit family…
The integral group rings $\mathbb{Z}G$ for finite groups $G$ are precisely those fusion rings whose basis elements have Frobenius-Perron dimension 1, and each is categorifiable in the sense that it arises as the Grothendieck ring of a…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
We give constructions of some special cases of $[n,k]$ Reed-Solomon codes over finite fields of size at least $n$ and $n+1$ whose generator matrices have constrained support. Furthermore, we consider a generalisation of the GM-MDS…
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…
The aim of this paper is to obtain a uniform bound for a certain class of submodules from the following theorem: Let $(R,\frak m)$ be a local ring, let $M$ be a finite $R$--module of dimension $d\ge 1$ and let $\frak q$ be an ideal of $R$…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
In this paper, we propose and study $r$-minimal codes, a natural extension of minimal codes which have been extensively studied with respect to Hamming metric, rank metric and sum-rank metric. We first propose $r$-minimal codes in a general…
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,…
Rings with Nakayama permutations, pseudo-Frobenius and Frobenius rings in particular, are studied by applying the general theory of formal matrix rings to their Peirce decompositions. A combinatorial criterion is given to decide whether a…
We prove that Chevalley groups over polynomial rings $\mathbb F_q[t]$ and over Laurent polynomial $\mathbb F_q[t,t^{-1}]$ rings, where $\mathbb F_q$ is a finite field, are boundedly elementarily generated. Using this we produce explicit…
Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…
We compute explicitly the limits of tangents of a quasi-ordinary singularity in terms of its special monomials. We show that the set of limits of tangents of Y is essentially a topological invariant of Y .
We study Reed--Solomon codes over arbitrary fields, inspired by several recent papers dealing with Gabidulin codes over fields of characteristic zero. Over the field of rational numbers, we derive bounds on the coefficient growth during…
This paper presents new upper bounds on the rate of linear $k$-hash codes in $\mathbb{F}_q^n$, $q\geq k$, that is, codes with the property that any $k$ distinct codewords are all simultaneously distinct in at least one coordinate.
Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…
We obtain some rigidity results for overdetermined boundary value problems for singular solutions in bounded domains.
Let R be a finite unitary ring whose group of units is not solvable but all groups of units of all its proper subrings are solvable. In this paper we classify these rings and show that all finite rings of order $p^n$ for $n < 5$ and some of…
We establish lower bounds for the operator norms of the Fourier restriction/extension operators associated to monomial curves with affine arclength measure. Furthermore, we prove that the set of all extremizing sequences of such an operator…