Searcharxiv⌕ Search

arXiv subjects

F. E. Brochero Martínez

Publications and source records attributed to F. E. Brochero Martínez.

16 recordsLinked to original sources
arXiv2025

Low-weight codewords in cyclic codes

We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that connects their weight distribution to the number of solutions of associated systems of polynomial equations. This relationship allows for the computation of weight distributions from known solutions of systems of diagonal equations and vice versa, offering a new insight into the structure and properties of binary cyclic codes.

math.NT↗
arXiv2022

The number of rational points of a class of superelliptic curves

In this paper, we study the number of $\mathbb F_{q^n}$-rational points on the affine curve $\mathcal{X}_{d,a,b}$ given by the equation $$ y^d=ax\text{Tr}(x)+b,$$ where $\text{Tr}$ denote the trace function from $\mathbb F_{q^n}$ to $\mathbb F_{q}$ and $d$ is a positive integer. In particular, we present bounds for the number of $\mathbb F_{q}$-rational points on $\mathcal{X}_{d,a,b}$ and, for the cases where $d$ satisfies a natural condition, explicit formulas for the number of rational points are obtained. Particularly, a complete characterization is given for the case $d=2$. As a consequence of our results, we compute the number of elements $α$ in $\mathbb F_{q^n}$ such that $α$ and $\text{Tr}(α)$ are quadratic residues in $\mathbb F_{q^n}$.

math.NT↗
arXiv2022

Artin-Schreier curves given by $\mathbb F_q$-linearized polynomials

Let $\mathbb F_q$ be a finite field with $q$ elements, where $q$ is a power of an odd prime $p$. In this paper we associate circulant matrices and quadratic forms with the Artin-Schreier curve $y^q - y= x \cdot F(x) - λ,$ where $F(x)$ is a $\mathbb F_q$-linearized polynomial and $λ\in \mathbb F_q$. Our results provide a characterization of the number of affine rational points of this curve in the extension $\mathbb F_{q^r}$ of $\mathbb F_q$, for $\gcd(q,r)=1$. In the case $F(x) = x^{q^i}-x$ we give a complete description of the number of affine rational points in terms of Legendre symbols and quadratic characters.

math.NT↗
arXiv2019

Factorization of Dickson polynomials over Finite Fields

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these polynomials in the case that every prime divisor of $n$ divides $q-1$. This result generalizes the results find in Chou, W.S., The Factorization of Dickson polynomials over finite fields. Finite Fields Appl. {\bf3} (1997) 84-96, Fitzgerald R. W., Yucas J. L., Explicit factorization of cyclotomic and Dickson polynomials over finite fields. Arithmetic of Finite Fields. Lecture Notes in Computer Science, vol. {\bf 4547}, pp. 1-10. Springer, Berlin (2007), Tosun, S., Explicit factorizations of generalized Dickson polynomials of order $2^{m}$ via generalized cyclotomic polynomials over finite fields. Finite Fields Appl. {\bf 38} (2016) 40-56 and Tosun, S., Explicit factors of generalized cyclotomic polynomials and generalized Dickson polynomials of order $2^m3$ over finite fields. Discrete Math. 342 (2019) DOI: j.disc.2019.111618

math.NT↗
arXiv2019

Permutation Binomials over Finite Fields

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for which the binomial $x^n(x^{(q-1)/r} + a)$ is a permutation polynomial in the cases $r = 2$ and $r = 3$.

math.NT↗
arXiv2019

Factorization of composed polynomials and applications

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial over $\mathbb F_q$. Our main results provide generalizations of recent works on the factorization of binomials $x^n-1$. As an application, we provide an explicit formula for the number of irreducible factors of $f(x^n)$ under some generic conditions on $f$ and $n$.

math.NT↗
arXiv2018

Möbius-Frobenius maps on irreducible polynomials

Let $n$ be a positive integer and let $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $q$ is a power of a prime. This paper introduces a natural action of the Projective Semilinear Group $\text{P}Γ\text{L}(2, q^n)=\text{PGL}(2, q^n)\rtimes \text{Gal}(\mathbb{F}_{q^n}/\mathbb{F}_q)$ on the set of monic irreducible polynomials over the finite field $\mathbb{F}_{q^n}$. Our main results provide information on the characterization and number of fixed points.

math.NT↗
arXiv2015

Factoring polynomials of the form $f(x^n)\in \mathbb{F}_q[x]$

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $ν_p(q-1)\ge ν_{p}(e)+ν_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine the irreducible factors of $f(x^n)$. We also show the irreducible factors in the case when ${\rm rad}(n)$ divides $q-1$ and ${\rm gcd}(m, n)=1$. Finally, using this algorithm we split $x^n-1$ into irreducible factors, in the case when $n=2^mp^t$ and $q$ is a generator of the group $\mathbb{Z}_{p^2}^*$.

math.NT↗
arXiv2014

Number of minimal cyclic codes with given length and dimension

In this article, we count the quantity of minimal cyclic codes of length $n$ and dimension $k$ over a finite field $\mathbb F_q$, in the case when the prime factors of $n$ satisfy a special condition. This problem is equivalent to count the quantity of irreducible factors of $x^n-1\in \mathbb F_q[x]$ of degree $k$.

cs.IT↗
arXiv2014

Explicit factorization of $x^n-1\in \mathbb F_q[x]$

Let $\mathbb F_q$ be a finite field and $n$ a positive integer. In this article, we prove that, under some conditions on $q$ and $n$, the polynomial $x^n-1$ can be split into irreducible binomials $x^t-a$ and an explicit factorization into irreducible factors is given. Finally, weakening one of our hypothesis, we also obtain factors of the form $x^{2t}-ax^t+b$ and explicit splitting of $x^n-1$ into irreducible factors is given.

cs.IT↗
arXiv2014

Structure of Finite dihedral group algebra

In this article, we show the relation between the irreducible idempotents of the cyclic group algebra $\mathbb F_qC_n$ and the central irreducible idempotents of the group algebras $\mathbb F_qD_{2n}$, where $\mathbb F_q$ is a finite field with $q$ elements and $D_{2n}$ is the dihedral group of order $2n$, where ${\rm gcd}(q,n)=1$.

math.RA↗
arXiv2014

Weight enumerator of some irreducible cyclic codes

In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length $n$ over a finite field $\mathbb F_q$, in the case which each prime divisor of $n$ is also a divisor of $q-1$.

cs.IT↗
arXiv2014

Explicit idempotents of finite group algebras

Let $\mathbb F_q$ be a finite field with $q$ elements, $G$ a finite cyclic group of order $p^k$ and $p$ is an odd prime with ${\rm gcd}(q,p)=1$. In this article, we determine an explicit expression for the primitive idempotents of $\mathbb F_qG$. This result extends the result in Arora-Pruthi [1] and Sharma-Bakshi-Dumir-Raka [8].

math.RA↗