Searcharxiv⌕ Search

arXiv subjects

Peter Beelen

Publications and source records attributed to Peter Beelen.

At least 37 records · Page 2Linked to original sources
arXiv2022

On the constant $D(q)$ defined by Homma

Let $\mathcal{X}$ be a projective, irreducible, nonsingular algebraic curve over the finite field $\mathbb{F}_q$ with $q$ elements and let $|\mathcal{X}(\mathbb{F}_q)|$ and $g(\mathcal X)$ be its number of rational points and genus respectively. The Ihara constant $A(q)$ has been intensively studied during the last decades, and it is defined as the limit superior of $|\mathcal{X}(\mathbb{F}_q)|/g(\mathcal X)$ as the genus of $\mathcal X$ goes to infinity. In 2012 Homma defined an analogue $D(q)$ of $A(q)$, where the nonsingularity of $\mathcal X$ is dropped and $g(\mathcal X)$ is replaced with the degree of $\mathcal X$. We will call $D(q)$ Homma's constant. In this paper, upper and lower bounds for the value of $D(q)$ are found.

math.NT↗
arXiv2021

Classification of all Galois subcovers of the Skabelund maximal curves

In 2017 Skabelund constructed two new examples of maximal curves $\tilde{\mathcal{S}}_q$ and $\tilde{\mathcal{R}}_q$ as covers of the Suzuki and Ree curves, respectively. The resulting Skabelund curves are analogous to the Giulietti-Korchmáros cover of the Hermitian curve. In this paper a complete characterization of all Galois subcovers of the Skabelund curves $\tilde{\mathcal{S}}_q$ and $\tilde{\mathcal{R}}_q$ is given. Calculating the genera of the corresponding curves, we find new additions to the list of known genera of maximal curves over finite fields.

math.NT↗
arXiv2020

Fast Encoding of AG Codes over $C_{ab}$ Curves

We investigate algorithms for encoding of one-point algebraic geometry (AG) codes over certain plane curves called $C_{ab}$ curves, as well as algorithms for inverting the encoding map, which we call "unencoding". Some $C_{ab}$ curves have many points or are even maximal, e.g. the Hermitian curve. Our encoding resp. unencoding algorithms have complexity $\tilde{O}(n^{3/2})$ resp. $\tilde{O}(qn)$ for AG codes over any $C_{ab}$ curve satisfying very mild assumptions, where $n$ is the code length and $q$ the base field size, and $\tilde{O}$ ignores constants and logarithmic factors in the estimate. For codes over curves whose evaluation points lie on a grid-like structure, notably the Hermitian curve and norm-trace curves, we show that our algorithms have quasi-linear time complexity $\tilde{O}(n)$ for both operations. For infinite families of curves whose number of points is a constant factor away from the Hasse--Weil bound, our encoding algorithm has complexity $\tilde{O}(n^{5/4})$ while unencoding has $\tilde{O}(n^{3/2})$.

math.AG↗
arXiv2020

A bound for the number of points of space curves over finite fields

For a non-degenerate irreducible curve $C$ of degree $d$ in $\mathbb{P}^3$ over $\mathbb{F}_q$, we prove that the number $N_q(C)$ of $\mathbb{F}_q$-rational points of $C$ satisfies the inequality $N_q(C) \leq (d-2)q+1$. Our result improves the previous bound $N_q(C) \leq (d-1)q+1$ obtained by Homma in 2012 and leads to a natural conjecture generalizing Sziklai's bound for the number of points of plane curves over finite fields.

math.AG↗
arXiv2020

Weierstrass semigroups on the Skabelund maximal curve

In 2017, D. Skabelund constructed a maximal curve over $\mathbb{F}_{q^4}$ as a cyclic cover of the Suzuki curve. In this paper we explicitly determine the structure of the Weierstrass semigroup at any point $P$ of the Skabelund curve. We show that its Weierstrass points are precisely the $\mathbb{F}_{q^4}$-rational points. Also we show that among the Weierstrass points, two types of Weierstrass semigroup occur: one for the $\mathbb{F}_q$-rational points, one for the remaining $\mathbb{F}_{q^4}$-rational points. For each of these two types its Apéry set is computed as well as a set of generators.

math.AG↗
arXiv2020

Maximum number of points on intersection of a cubic surface and a non-degenerate Hermitian surface

In 1991 Sørensen proposed a conjecture for the maximum number of points on the intersection of a surface of degree $d$ and a non-degenerate Hermitian surface in $\PP^3(\Fqt)$. The conjecture was proven to be true by Edoukou in the case when $d=2$. In this paper, we prove that the conjecture is true for $d=3$ and $q \ge 8$. We further determine the second highest number of rational points on the intersection of a cubic surface and a non-degenerate Hermitian surface. Finally, we classify all the cubic surfaces that admit the highest and second highest number of points in common with a non-degenerate Hermitian surface. This classifications disproves one of the conjectures proposed by Edoukou, Ling and Xing.

math.AG↗
arXiv2020

A proof of Sørensen's conjecture on Hermitian surfaces

In this article we prove a conjecture formulated by A.B. Soerensen in 1991 on the maximal number of $\mathbb{F}_{q^2}$-rational points on the intersection of a non-degenerate Hermitian surface and a surface of degree $d \le q.$

math.AG↗
arXiv2020

Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes

In this article, we consider the decoding problem of Grassmann codes using majority logic. We show that for two points of the Grassmannian, there exists a canonical path between these points once a complete flag is fixed. These paths are used to construct a large set of parity checks orthogonal on a coordinate of the code, resulting in a majority decoding algorithm.

cs.IT↗
arXiv2018

On subfields of the second generalization of the GK maximal function field

The second generalized GK function fields $K_n$ are a recently found family of maximal function fields over the finite field with $q^{2n}$ elements, where $q$ is a prime power and $n \ge 1$ an odd integer. In this paper we construct many new maximal function fields by determining various Galois subfields of $K_n$. In case $\gcd(q+1,n)=1$ and either $q$ is even or $q \equiv 1 \pmod{4},$ we find a complete list of Galois subfields of $K_n.$ Our construction adds several previously unknown genera to the genus spectrum of maximal curves.

math.AG↗
arXiv2018

On the Deuring Polynomial for Drinfeld Modules in Legendre Form

We study a family $ψ^λ$ of $\mathbb F_q[T]$-Drinfeld modules, which is a natural analog of Legendre elliptic curves. We then find a surprising recurrence giving the corresponding Deuring polynomial $H_{p(T)}(λ)$ characterising supersingular Legendre Drinfeld modules $ψ^λ$ in characteristic $p(T)$.

math.NT↗
arXiv2018

Linear Codes Associated to Skew-symmetric Determinantal Varieties

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.

math.CO↗
arXiv2018

Hyperplane Sections of Determinantal Varieties over Finite Fields and Linear Codes

We determine the number of ${\mathbb{F}}_q$-rational points of hyperplane sections of classical determinantal varieties defined by the vanishing of minors of a fixed size of a generic matrix, and identify sections giving the maximum number of ${\mathbb{F}}_q$-rational points. Further we consider similar questions for sections by linear subvarieties of a fixed codimension in the ambient projective space. This is closely related to the study of linear codes associated to determinantal varieties, and the determination of their weight distribution, minimum distance and generalized Hamming weights. The previously known results about these are generalized and expanded significantly

math.CO↗
arXiv2018

Vanishing ideals of projective spaces over finite fields and a projective footprint bound

We consider the vanishing ideal of a projective space over a finite field. An explicit set of generators for this ideal has been given by Mercier and Rolland. We show that these generators form a universal Gröbner basis of the ideal. Further we give a projective analogue of the footprint bound, and a version of it that is suitable for estimating the number of points of a projective algebraic variety over a finite field. An application to Serre's inequality for the number of rational points of projective hypersurfaces over finite fields is included

math.AG↗
arXiv2018

A new family of maximal curves

In this article we construct for any prime power $q$ and odd $n \ge 5$, a new $\mathbb{F}_{q^{2n}}$-maximal curve $\mathcal X_n$. Like the Garcia--G\" uneri--Stichtenoth maximal curves, our curves generalize the Giulietti--Korchmáros maximal curve, though in a different way. We compute the full automorphism group of $\mathcal X_n$, yielding that it has precisely $q(q^2-1)(q^n+1)$ automorphisms. Further, we show that unless $q=2$, the curve $\mathcal{X}_n$ is not a Galois subcover of the Hermitian curve. Finally, we find new values of the genus spectrum of $\mathbb{F}_{q^{2n}}$-maximal curves, by considering some Galois subcovers of $\mathcal X_n$.

math.AG↗
arXiv2018

Structural Properties of Twisted Reed-Solomon Codes with Applications to Cryptography

We present a generalisation of Twisted Reed-Solomon codes containing a new large class of MDS codes. We prove that the code class contains a large subfamily that is closed under duality. Furthermore, we study the Schur squares of the new codes and show that their dimension is often large. Using these structural properties, we single out a subfamily of the new codes which could be considered for code-based cryptography: These codes resist some existing structural attacks for Reed-Solomon-like codes, i.e. methods for retrieving the code parameters from an obfuscated generator matrix.

cs.IT↗
arXiv2017

Two-Point Codes for the Generalized GK curve

We improve previously known lower bounds for the minimum distance of certain two-point AG codes constructed using a Generalized Giulietti-Korchmaros curve (GGK). Castellanos and Tizziotti recently described such bounds for two-point codes coming from the Giulietti-Korchmaros curve (GK). Our results completely cover and in many cases improve on their results, using different techniques, while also supporting any GGK curve. Our method builds on the order bound for AG codes: to enable this, we study certain Weierstrass semigroups. This allows an efficient algorithm for computing our improved bounds. We find several new improvements upon the MinT minimum distance tables.

cs.IT↗
arXiv2017

Explicit MDS Codes with Complementary Duals

In 1964, Massey introduced a class of codes with complementary duals which are called Linear Complimentary Dual (LCD for short) codes. He showed that LCD codes have applications in communication system, side-channel attack (SCA) and so on. LCD codes have been extensively studied in literature. On the other hand, MDS codes form an optimal family of classical codes which have wide applications in both theory and practice. The main purpose of this paper is to give an explicit construction of several classes of LCD MDS codes, using tools from algebraic function fields. We exemplify this construction and obtain several classes of explicit LCD MDS codes for the odd characteristic case.

cs.IT↗