中文
相关论文

相关论文: Complete solution over $\GF{p^n}$ of the equation …

200 篇论文

Solving the equation $P_a(X):=X^{q+1}+X+a=0$ over finite field $\GF{Q}$, where $Q=p^n, q=p^k$ and $p$ is a prime, arises in many different contexts including finite geometry, the inverse Galois problem \cite{ACZ2000}, the construction of…

信息论 · 计算机科学 2020-01-01 Kwang Ho Kim , Junyop Choe , Sihem Mesnager

In this paper, the polynomials $P_a(x)=x^{2^l+1}+x+a$ with $a\in\mathrm{GF}(2^k)$ are studied. New criteria for the number of zeros of $P_a(x)$ in $\mathrm{GF}(2^k)$ are proved. In particular, a criterion for $P_a(x)$ to have exactly one…

离散数学 · 计算机科学 2009-10-07 Tor Helleseth , Alexander Kholosha

Let $N_a$ be the number of solutions to the equation $x^{2^k+1}+x+a=0$ in $\GF {n}$ where $\gcd(k,n)=1$. In 2004, by Bluher \cite{BLUHER2004} it was known that possible values of $N_a$ are only 0, 1 and 3. In 2008, Helleseth and Kholosha…

信息论 · 计算机科学 2019-03-19 Kwang Ho Kim , Sihem Mesnager

Let $l$ and $k$ be two integers such that $l|k$. Define $T_l^k(X):=X+X^{p^l}+\cdots+X^{p^{l(k/l-2)}}+X^{p^{l(k/l-1)}}$ and $S_l^k(X):=X-X^{p^l}+\cdots+(-1)^{(k/l-1)}X^{p^{l(k/l-1)}}$, where $p$ is any prime. This paper gives explicit…

信息论 · 计算机科学 2020-02-19 Sihem Mesnager , Kwang Ho Kim , Jong Hyok Choe , Dok Nam Lee

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…

信息论 · 计算机科学 2019-05-28 Kwang Ho Kim , Jong Hyok Choe , Dok Nam Lee , Dae Song Go , Sihem Mesnager

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the…

数论 · 数学 2016-05-13 Ioulia N. Baoulina

Using recent results on solving the equation $X^{2^k+1}+X+a=0$ over a finite field $\mathbb{F}_{2^n}$, we address an open question raised by the first author in WAIFI 2014 concerning the APN-ness of the Kasami functions $x\mapsto…

信息论 · 计算机科学 2020-02-04 Claude Carlet , Kwang Ho Kim , Sihem Mesnager

Let $F(X)=X^{2^{2k}+2^k+1}$ be the power function over the finite field $\GF{2^{4k}}$ which is known as the Bracken-Leander function. In \cite{BCC10,BL10,CV20,Fu22,XY17}, it was proved that the number of solutions in $\GF{q^4}$ to the…

信息论 · 计算机科学 2023-05-23 Kwang Ho Kim , Sihem Mesnager , Chung Hyok Kim

Let $p$ be a prime, $k$ a positive integer and let $\mathbb{F}_q$ be the finite field of $q=p^k$ elements. Let $f(x)$ be a polynomial over $\mathbb F_q$ and $a\in\mathbb F_q$. We denote by $N_{s}(f,a)$ the number of zeros of…

数论 · 数学 2021-08-13 Chaoxi Zhu , Yulu Feng , Shaofang Hong , Junyong Zhao

Linearized polynomials over finite fields have been intensively studied over the last several decades. Interesting new applications of linearized polynomials to coding theory and finite geometry have been also highlighted in recent years.…

信息论 · 计算机科学 2020-11-24 Kwang Ho Kim , Sihem Mesnager , Jong Hyok Choe , Dok Nam Lee

Let $p$ be a prime number, $m$ be an even positive integer, and $\mathbb{F}_q$ be a finite field with $q = p^m$ elements. In this paper, we compute the number of solutions with all coordinates in $\mathbb{F}_q^*$ for diagonal equations of…

数论 · 数学 2025-02-04 José Gustavo Coelho

Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the underdefined…

密码学与安全 · 计算机科学 2015-07-15 Heliang Huang , Wansu Bao

Let $\mathbb{F}_q$ denote the finite field of characteristic $p$ and order $q$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic rational integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. Given two positive…

数论 · 数学 2023-10-25 Weihua Li , Wei Cao

We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…

经典分析与常微分方程 · 数学 2009-02-03 Diego Dominici , Kathy Driver , Kerstin Jordaan

In this paper, we will investigate the solvability of the equation $x_1^k + x_2^k + \ldots + x_s^k = n$, $n\in \mathbb{Z}_{p^k}$, $x_1,...,x_s\in \mathcal{A}$, $\mathcal{A}\subseteq \mathbb{Z}_{p^k}$. We will give a upper bound of the…

组合数学 · 数学 2019-05-01 An-Ping Li

We prove an explicit formula for the number of $n \times n$ upper triangular matrices, over $GF(q)$, whose square is the zero matrix. This formula was recently conjectured by Sasha Kirillov and Anna Melnikov[KM].

组合数学 · 数学 2008-02-03 Shalosh B. Ekhad , Doron Zeilberger

We apply the discontinuous Galerkin finite element method with a degree $p$ polynomial basis to the linear advection equation and derive a PDE which the numerical solution solves exactly. We use a Fourier approach to derive polynomial…

数值分析 · 数学 2015-01-22 Noel Chalmers , Lilia Krivodonova

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

综合数学 · 数学 2017-08-11 Yochay Jerby

In this paper, we obtain an explicit combinatorial formula for the number of solutions $(x_1,\ldots,x_r)\in \mathbb{F}_{p^{ab}}$ to the diagonal equation $x_{1}^k+\cdots+x_{r}^k=\alpha$ over the finite field $\mathbb{F}_{p^{ab}}$, with…

组合数学 · 数学 2019-12-17 Denis E. Videla

In this paper the nonlinear matrix equation X-A^{*}X^{-p}A=Q with p>0 is investigated. We consider two cases of this equation: the case p>1 and the case 0<p<1. In the case p>1, a new sufficient condition for the existence of a unique…

数值分析 · 数学 2012-09-13 Jing Li
‹ 上一页 1 2 3 10 下一页 ›