Related papers: A Further Investigation on Complete Complementary …
In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices…
We introduce new first-order necessary conditions for mathematical programs with complementarity constraints (MPCCs), which lie between strong and M-stationarity and have a relatively simple description. We show that they hold for local…
The smallest possible length of a $q$-ary linear code of covering radius $R$ and codimension (redundancy) $r$ is called the length function and is denoted by $\ell_q(r,R)$. In this work, for $q$ \emph{an arbitrary prime power}, we obtain…
Constant weight codes (CWCs) and constant composition codes (CCCs) are two important classes of codes that have been studied extensively in both combinatorics and coding theory for nearly sixty years. In this paper we show that for {\it…
Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic…
Parameterized quantum circuits (PQCs) have emerged as a promising approach for quantum neural networks. However, understanding their expressive power in accomplishing machine learning tasks remains a crucial question. This paper…
Flag codes generalize constant dimension codes by considering sequences of nested subspaces with prescribed dimensions as codewords. A comprehensive construction, which unites cyclic orbit flag codes, yields two families of flag codes on…
We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…
Locally repairable codes are widely applicable in contemporary large-scale distributed cloud storage systems and various other areas. By making use of some algebraic structures of elliptic curves, Li et al. developed a series of $q$-ary…
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function…
The fitting problem for conjunctive queries (CQs) is the problem to construct a CQ that fits a given set of labeled data examples. When a fitting CQ exists, it is in general not unique. This leads us to proposing natural refinements of the…
We obtain the following results. For any prime $q$ the minimal Hamming distance between distinct regular $q$-ary bent functions of $2n$ variables is equal to $q^n$. The number of $q$-ary regular bent functions at the distance $q^n$ from the…
Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…
Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r<n$, with $n$ or $r$ (or both) odd, MDS LCD $(n,r)$ codes are constructed over finite fields whose…
Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives strictly stronger protection than the data, such a code is called…
Let $m$ be a positive integer, $q$ be a prime power, and $\mathrm{PG}(2,q)$ be the projective plane over the finite field $\mathbb F_q$. Finding complete $m$-arcs in $\mathrm{PG}(2,q)$ of size less than $q$ is a classical problem in finite…
Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic…
The $q$-commutation relations, formulated in the setting of the $q$-Fock space of Bo\.zjeko and Speicher, interpolate between the classical commutation relations (CCR) and the classical anti-commutation relations (CAR) defined on the…
We consider the problem of computing the minimum length of functional batch and PIR codes of fixed dimension and for a fixed list size, over an arbitrary finite field. We recover, generalize, and refine several results that were previously…