Related papers: Generic polynomials for cyclic function field exte…

Let $\mathcal{A}$ be a finite-dimensional algebra over a finite field $\mathbf{F}_q$ and let $G=\mathcal{A}^\times$ be the multiplicative group of $\mathcal{A}$. In this paper, we construct explicitly a generic Galois $G$-extension $S/R$,…

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length $s\ell$ with index $s$ over the finite field $\mathbb{F}$ are $\mathbb{F}[y]$-submodules of the ring $\frac{\mathbb{F}[x,y]}{<…

We give a construction of the genus field for Kummer $\ell^n$-cyclic extensions of rational congruence function fields, where $\ell$ is a prime number. First, we compute the genus field of a field contained in a cyclotomic function field,…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Let $\ell$ be an odd prime, $q$ an odd prime power such that $q \not\equiv 0 \pmod \ell$, and $m$ the order of $q$ in $\F_\ell^\times$. We propose an explicit $L$-polynomial of hyperelliptic function field $K:=\F_q(T,…

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Two-dimensional cyclic codes of length $n=\ell s$ over the finite field $\mathbb{F}$ are ideals of the polynomial ring $\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >}$. The aim of this paper, is to present a novel method to study the…

In this paper, we investigate permutation polynomials over the finite field $\mathbb F_{q^n}$ with $q=2^m$, focusing on those in the form $\mathrm{Tr}(Ax^{q+1})+L(x)$, where $A\in\mathbb F_{q^n}^*$ and $L$ is a $2$-linear polynomial over…

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

We study cyclic finite Galois extensions of the rational function field of the projective line P^{1}(F_q) over a finite field F_q with q elements defined by considering quotient curves by finite subgroups of the projective linear group…

We study fluctuations in the number of points of $\ell$-cyclic covers of the projective line over the finite field $\mathbb{F}_q$ when $q \equiv 1 \mod \ell$ is fixed and the genus tends to infinity. The distribution is given as a sum of…

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…

Recently, a $q$-polynomial approach to the construction and analysis of cyclic codes over $\gf(q)$ was given by Ding and Ling. The objective of this paper is to give another $q$-polynomial approach to all cyclic codes over $\gf(q)$.

In this paper we present the generalization of the higher order q-Euler numbers and q-Genocchi numbers and w-Genocchi numbers and polynomials of high order using the multivariate fermionic p-adic integral on Zp. We have the interpolation…

In this article, we introduce and study the concept of the exponent of a cyclic code over a finite field $\mathbb{F}_q.$ We give a relation between the exponent of a cyclic code and its dual code. Finally, we introduce and determine the…

We give necessary and sufficient conditions for a polynomial of the form x^r*(1+x^v+x^(2v)+...+x^(kv))^t to permute the elements of the finite field GF(q). Our results yield especially simple criteria in case (q-1)/gcd(q-1,v) is a small…

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

The generalized cyclotomic mappings over finite fields $\mathbb{F}_{q}$ are those mappings which induce monomial functions on all cosets of an index $\ell$ subgroup $C_0$ of the multiplicative group $\mathbb{F}_{q}^{*}$. Previous research…

In this paper we consider generalized monomial functions $f, g\colon \mathbb{F}\to \mathbb{C}$ (of possibly different degree) that also fulfill \[ f(P(x))= Q(g(x)) \qquad \left(x\in \mathbb{F}\right), \] where $P\in \mathbb{F}[x]$ and $Q\in…