Related papers: Symmetric bilinear forms over finite fields with a…

We construct a categorification of the modular data associated with every family of unipotent characters of the spetsial complex reflection group $G(d,1,n)$. The construction of the category follows the decomposition of the Fourier matrix…

We overcome the barrier of constructing N=4 superconformal models in one space dimension for more than three particles. The D(2,1;alpha) superalgebra of our systems is realized on the coordinates and momenta of the particles, their…

We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Let $\cal M$ denote the set ${\cal S}_{n, q}$ of $n \times n$ symmetric matrices with entries in ${\rm GF}(q)$ or the set ${\cal H}_{n, q^2}$ of $n \times n$ Hermitian matrices whose elements are in ${\rm GF}(q^2)$. Then $\cal M$ equipped…

Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…

By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…

Let V be a vector space of dimension n over the finite field F_q, where q is odd, and let Symm(V) denote the space of symmetric bilinear forms defined on V x V. We investigate constant rank r subspaces of Symm(V) in this paper. We have…

Subfield codes of linear codes over finite fields have recently received much attention. Some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, the $q$-ary…

The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new…

The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…

Let $n_q(M,d)$ be the minimum length of a $q$-ary code of size $M$ and minimum distance $d$. Bounding $n_q(M,d)$ is a fundamental problem that lies at the heart of coding theory. This work considers a generalization $n^\bx_q(M,d)$ of…

Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…

The aim of this work is to extend the study of super-coinvariant polynomials, to the case of the generalized symmetric group $G_{n,m}$, defined as the wreath product $C_m\wr\S_n$ of the symmetric group by the cyclic group. We define a…

It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…

Let $\mathbb{F}_q$ be the finite field of $q$ elements. In this paper we obtain bounds on the following counting problem: given a polynomial $f(x)\in \mathbb{F}_q[x]$ of degree $k+m$ and a non-negative integer $r$, count the number of…

Let $G_{(m,3,r)}=\langle x,y\mid x^m=1, y^3=1,yx=x^ry\rangle$ be a metacyclic group of order $3m$, where ${\rm gcd}(m,r)=1$, $1<r<m$ and $r^3\equiv 1$ (mod $m$). Then left ideals of the group algebra $\mathbb{F}_q[G_{(m,3,r)}]$ are called…

We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…