5 research outputs found
Complete solution over \GF{p^n} of the equation
The problem of solving explicitly the equation over the finite
field \GF{Q}, where , and is a prime, arises in
many different contexts including finite geometry, the inverse
Galois problem \cite{ACZ2000}, the construction of difference sets
with Singer parameters \cite{DD2004}, determining cross-correlation
between -sequences \cite{DOBBERTIN2006} and to construct error
correcting codes \cite{Bracken2009}, cryptographic APN functions
\cite{BTT2014,Budaghyan-Carlet_2006}, designs \cite{Tang_2019}, as
well as to speed up the index calculus method for computing discrete
logarithms on finite fields \cite{GGGZ2013,GGGZ2013+} and on
algebraic curves \cite{M2014}.
Subsequently, in
\cite{Bluher2004,HK2008,HK2010,BTT2014,Bluher2016,KM2019,CMPZ2019,MS2019,KCM19},
the \GF{Q}-zeros of have been studied. In
\cite{Bluher2004}, it was shown that the possible values of the
number of
the zeros that has in \GF{Q} is , , or .
Some criteria for the number of the \GF{Q}-zeros of were
found in \cite{HK2008,HK2010,BTT2014,KM2019,MS2019}.
However, while the ultimate goal is to explicit all the
\GF{Q}-zeros, even in the case , it was solved only under the condition \cite{KM2019}.
In this article, we discuss this equation without any restriction on and
. In \cite{KCM19}, for the cases of one or two
\GF{Q}-zeros, explicit expressions for these rational zeros in
terms of were provided, but for the case of
\GF{Q}- zeros it was remained open to explicitly compute the
zeros. This paper solves the remained problem, thus now the equation
over \GF{p^n} is completely solved for any prime
, any integers and
Decoding and constructions of codes in rank and Hamming metric
As coding theory plays an important role in data transmission, decoding algorithms for new families of error correction codes are of great interest. This dissertation is dedicated to the decoding algorithms for new families of maximum rank distance (MRD) codes including additive generalized twisted Gabidulin (AGTG) codes and Trombetti-Zhou (TZ) codes, decoding algorithm for Gabidulin codes beyond half the minimum distance and also encoding and decoding algorithms for some new optimal rank metric codes with restrictions.
We propose an interpolation-based decoding algorithm to decode AGTG codes where the decoding problem is reduced to the problem of solving a projective polynomial equation of the form q(x) = xqu+1 +bx+a = 0 for a,b ∈ Fqm. We investigate the zeros of q(x) when gcd(u,m)=1 and proposed a deterministic algorithm to solve a linearized polynomial equation which has a close connection to the zeros of q(x).
An efficient polynomial-time decoding algorithm is proposed for TZ codes. The interpolation-based decoding approach transforms the decoding problem of TZ codes to the problem of solving a quadratic polynomial equation. Two new communication models are defined and using our models we manage to decode Gabidulin codes beyond half the minimum distance by one unit. Our models also allow us to improve the complexity for decoding GTG and AGTG codes.
Besides working on MRD codes, we also work on restricted optimal rank metric codes including symmetric, alternating and Hermitian rank metric codes. Both encoding and decoding algorithms for these optimal families are proposed. In all the decoding algorithms presented in this thesis, the properties of Dickson matrix and the BM algorithm play crucial roles.
We also touch two problems in Hamming metric. For the first problem, some cryptographic properties of Welch permutation polynomial are investigated and we use these properties to determine the weight distribution of a binary linear codes with few weights. For the second one, we introduce two new subfamilies for maximum weight spectrum codes with respect to their weight distribution and then we investigate their properties.Doktorgradsavhandlin