Related papers: Minimal linear codes in odd characteristic
In this paper, the sufficient and necessary condition for the minimum distance of the BCH codes over $\mathbb{F}_q$ with length $q+1$ and designed distance 3 to be 3 and 4 are provided. Let $d$ be the minimum distance of the BCH code…
The exploration of linear subspaces, particularly scattered subspaces, has garnered considerable attention across diverse mathematical disciplines in recent years, notably within finite geometries and coding theory. Scattered subspaces play…
We study the classification of minimal codewords of projective Reed-Muller codes of order $2$. This problem is equivalent to identifying quadrics over finite fields whose set of rational points is maximal with respect to the inclusion. We…
A class of scattered linearized polynomials covering infinitely many field extensions is exhibited. More precisely, the $q$-polynomial over $\mathbb F_{q^6}$, $q \equiv 1\pmod 4$ described in arXiv:1906.05611, arXiv:1910.02278 is…
We study properties of rank metric and codes in rank metric over finite fields. We show that in rank metric perfect codes do not exist. We derive an existence bound that is the equivalent of the Gilbert--Varshamov bound in Hamming metric.…
The present article studies the finite Zariski tangent spaces to an affine variety X as linear codes, in order to characterize their typical or exceptional properties by global geometric conditions on X. The discussion concerns the generic…
We discuss the log minimal model theory for log surfaces. We show that the log minimal model program, the finite generation of log canonical rings, and the log abundance theorem for log surfaces hold true under assumptions weaker than the…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…
Recently, a strong exponential character bound has been established in [3] for all elements $g \in \mathbf{G}^F$ of a finite reductive group $\mathbf{G}^F$ which satisfy the condition that the centraliser $C_{\mathbf{G}}(g)$ is contained in…
This paper gives new methods of constructing {\it symmetric self-dual codes} over a finite field $GF(q)$ where $q$ is a power of an odd prime. These methods are motivated by the well-known Pless symmetry codes and quadratic double circulant…
We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are…
A family of minimal cubature rules is established on an unbounded domain, which is the first such family known on unbounded domains. The nodes of such cubature rules are common zeros of certain orthogonal polynomials on the unbounded…
A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…
We obtain finiteness theorems for algebraic cycles of small codimension on quadric fibrations X over curves over perfect fields k. For example, if k is finitely generated over Q and the fibration has odd relative dimension at least 11, then…
We find new lower bounds on the torsion orders of very general Fano hypersurfaces over (uncountable) fields of arbitrary characteristic. Our results imply that unirational parametrizations of most Fano hypersurfaces need to have enormously…
The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
We construct families of locally recoverable codes with availability $t\geq 2$ using fiber products of curves, determine the exact minimum distance of many families, and prove a general theorem for minimum distance of such codes. The paper…
Let $G$ be a finite $p$-solvable group, where $p$ is an odd prime. We establish a connection between extendible irreducible characters of subgroups of $G$ that lie under monomial characters of $G$ and nilpotent subgroups of $G$. We also…
A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…