Related papers: Generalized Reed-Muller codes and curves with many…
In this note, we reveal a relation between the weight distribution of a concatenated code ensemble based on the Plotkin construction and those of its component codes. The relation may find applications in the calculation of the ensemble…
In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code…
The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…
In this paper we prove an incidence bound for points and cubic curves over prime fields. The methods generalise those used by Mohammadi, Pham, and Warren (2021).
We introduce the sum-rank metric analogue of Reed--Muller codes, which we called linearized Reed--Muller codes, using multivariate Ore polynomials. We study the parameters of these codes, compute their dimension and give a lower bound for…
We consider the problem of bounding the dimension of the linear system of curves in ${\bf P}^2$ of degree $d$ with prescribed multiplicities $m_1,...,m_n$ at $n$ general points (\cite{Hir1},\cite{Hir2}). We propose a new method, based on…
We propose a conjectural construction of global points on modular elliptic curves over arbitrary number fields, generalizing both the p-adic construction of Heegner points via Cerednik-Drinfeld uniformization and the definition of classical…
As we all know, many interesting and important codes are obtained by modifying or combining existing codes. In this paper, we focus on generalized Roth-Lempel (in short, GRL) codes and define a class of extended codes, i.e., the extended…
We present a fundamental theory of curves in the affine plane and the affine space, equipped with the general-affine groups ${\rm GA}(2)={\rm GL}(2,{\bf R})\ltimes {\bf R}^2$ and ${\rm GA}(3)={\rm GL}(3,{\bf R})\ltimes {\bf R}^3$,…
Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…
Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…
For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
We present new constructions of quasi-cyclic (QC) and generalized quasi-cyclic (GQC) codes from algebraic curves. Unlike previous approaches based on elliptic curves, our method applies to curves that are Kummer extensions of the rational…
The problem of constructing curves with many points over finite fields has received considerable attention in the recent years. Using the class field theory approach, we construct new examples of curves ameliorating some of the known…
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 study a family of curves obtained by fibre products of hyperelliptic curves. We then exploit this family to construct examples of curves of given genus g over a finite field Fq with many rational points. The results…
We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a…
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete…
In this note we consider questions about parametrisations of elliptic curves defined over number fields by quotients of the upper half-plane by finite index subgroups of SL_2(Z). We ask if we can choose such a parametrisation of an elliptic…