相关论文: Distance Distribution to Received Words in Reed-So…

We consider the set of monic irreducible polynomials $P$ over a finite field $\mathbb{F}_q$ such that the multiplicative order modulo $P$ of some a in $\mathbb{F}_q(T)$ is divisible by a fixed positive integer $d$. Call $R_q(a,d)$ this set.…

Let ${\mathbb{F}_{q}}$ be the finite field of order $q$. Let $G$ be one of the three groups ${\rm GL}(n, \mathbb{F}_q)$, ${\rm SL}(n, \mathbb{F}_q)$ or ${\rm U}(n, \mathbb{F}_q)$ and let $W$ be the standard $n$-dimensional representation of…

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

Let $\mathbb{F}_q$ be the finite field of order $q$ and $E\subset \mathbb{F}_q^d$, where $4|d$. Using Fourier analytic techniques, we prove that if $|E|>\frac{q^{d-1}}{d}\binom{d}{d/2}\binom{d/2}{d/4}$, then the points of $E$ determine a…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

An exponential polynomial of order $q$ is an entire function of the form $$ f(z)=P_1(z)e^{Q_1(z)}+\cdots +P_k(z)e^{Q_k(z)}, $$ where the coefficients $P_j(z),Q_j(z)$ are polynomials in $z$ such that $$ \max\{\deg{Q_j}\}=q. $$ In 1977…

Let $K/\mathbb{Q}$ be a finite extension. We prove that the minimal height of polynomials of degree $n$ of which all roots are in $K^\times$ increases exponentially in $n$. We determine the implied constant exactly for totally real $K$ and…

A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

We determine all permutation polynomials over F_{q^2} of the form X^r A(X^{q-1}) where, for some Q which is a power of the characteristic of F_q, the integer r is congruent to Q+1 (mod q+1) and all terms of A(X) have degrees in {0, 1, Q,…

Let $f\in\Bbb F_q[X_1,\dots,X_n]$ with $\deg f=d>0$ and let $Z(f)=\{(x_1,\dots,x_n)\in \Bbb F_q^n: f(x_1,\dots,x_n)=0\}$. Ax's theorem states that $|Z(f)|\equiv 0\pmod {q^{\lceil n/d\rceil-1}}$, that is, $\nu_p(|Z(f)|)\ge m(\lceil…

The plane partition polynomial $Q_n(x)$ is the polynomial of degree $n$ whose coefficients count the number of plane partitions of $n$ indexed by their trace. Extending classical work of E.M. Wright, we develop the asymptotics of these…

In this note, we provide a description of the elements of minimum rank of a generalized Gabidulin code in terms of Grassmann coordinates. As a consequence, a characterization of linearized polynomials of rank at most $n-k$ is obtained, as…

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a…

The aim of this article is to obtain a formula giving, for a positive integer $n$, the number of roots of the $n^{th}$ continuant polynomial over a finite local ring. In particular, we will give counting formulae for the roots of the…

We develop algorithms for writing a polynomial as sums of powers of low degree polynomials. Consider an $n$-variate degree-$d$ polynomial $f$ which can be written as $$f = c_1Q_1^{m} + \ldots + c_s Q_s^{m},$$ where each $c_i\in…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…