Solving x^2^k+1+x+a=0 in F_2^n with (n,k)=1

03/18/2019
by   Kwang Ho Kim, et al.
0

Let N_a be the number of solutions to the equation x^2^k+1+x+a=0 in n where (k,n)=1. In 2004, by Bluher BLUHER2004 it was known that possible values of N_a are only 0, 1 and 3. In 2008, Helleseth and Kholosha HELLESETH2008 have got criteria for N_a=1 and an explicit expression of the unique solution when (k,n)=1. In 2014, Bracken, Tan and Tan BRACKEN2014 presented a criterion for N_a=0 when n is even and (k,n)=1. This paper completely solves this equation x^2^k+1+x+a=0 with only condition (n,k)=1. We explicitly calculate all possible zeros in n of P_a(x). New criterion for which a, N_a is equal to 0, 1 or 3 is a by-product of our result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2023

Solving X^2^2k+2^k+1+(X+1)^2^2k+2^k+1=b over 2^4k

Let F(X)=X^2^2k+2^k+1 be the power function over the finite field 2^4k w...
research
05/12/2019

The compound product distribution; a solution to the distributional equation X=AX+1

The solution of X=AX+1 is analyzed for a discrete variable A with P...
research
08/30/2022

Loop dynamics of a fully discrete short pulse equation

In this article, a fully discrete short pulse (SP) equation is presented...
research
01/21/2023

On the solutions to Efron's self-consistency equation

The main purpose of this note is to provide a new and simple proof that ...
research
11/25/2021

Uniqueness in determination of the fractional order in the TFDE using one measurement

This article deals with an inverse problem of identifying the fractional...
research
03/09/2021

A sampling criterion for constrained Bayesian optimization with uncertainties

We consider the problem of chance constrained optimization where it is s...
research
07/18/2021

AC Simplifications and Closure Redundancies in the Superposition Calculus

Reasoning in the presence of associativity and commutativity (AC) is wel...

Please sign up or login with your details

Forgot password? Click here to reset