English
Related papers

Related papers: Construction of sequences with high nonlinear comp…

200 papers

Multisequences over finite fields play a pushing role in the applications that relate to parallelization, such as word-based stream ciphers and pseudorandom vector generation. It is interesting to study the complexity measures for…

Information Theory · Computer Science 2020-01-30 Yang Yan , Qiuyan Wang , Chenhuang Wu

For each proper divisor d of (r^2-r+1), r being a power of a prime, maximal curves over a finite field with r^2 elements covered by the Hermitian curve of genus 1/2((r^2-r+1)/d-1) are constructed.

Algebraic Geometry · Mathematics 2007-05-23 A. Cossidente , G. Korchmaros , F. Torres

In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…

Information Theory · Computer Science 2022-09-01 Shu Liu , Liming Ma , Ting-Yi Wu , Chaoping Xing

The number A(q) is the upper limit of the ratio of the maximum number of points of a curve defined over $\Fq$ to the genus. By constructing class field towers with good parameters we present improvements of lower bounds of A(q) for q an odd…

Number Theory · Mathematics 2007-05-23 Wen-Ching Li , Hiren Maharaj

It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…

Information Theory · Computer Science 2019-12-23 Lingfei Jin , Liming Ma , Chaoping Xing

A permutation rational function $f\in \mathbb{F}_q(x)$ is a rational function that induces a bijection on $\mathbb{F}_q$, that is, for all $y\in\mathbb{F}_q$ there exists exactly one $x\in\mathbb{F}_q$ such that $f(x)=y$. Permutation…

Number Theory · Mathematics 2017-07-20 Gaetan Bisson , Mehdi Tibouchi

For a given elliptic curve $\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\dots$ which complements earlier…

Number Theory · Mathematics 2015-10-08 László Mérai , Arne Winterhof

We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from $\mathbb{F}_q^n$ to $\mathbb{F}_q$ to the set of affine functions from $\mathbb{F}_q^n$ to $\mathbb{F}_q$. We prove…

Combinatorics · Mathematics 2019-09-17 Kai-Uwe Schmidt

Let $K$ be an imaginary quadratic field, and let $\mathcal{O}_{K,f}$ be an order in $K$ of conductor $f\geq 1$. Let $E$ be an elliptic curve with CM by $\mathcal{O}_{K,f}$, such that $E$ is defined by a model over $\mathbb{Q}(j_{K,f})$,…

Number Theory · Mathematics 2024-08-30 Asimina S. Hamakiotes

We give a construction of singular curves with many rational points over finite fields. This construction enables us to prove some results on the maximum number of rational points on an absolutely irreducible projective algebraic curve…

Algebraic Geometry · Mathematics 2015-10-05 Yves Aubry , Annamaria Iezzi

Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…

Information Theory · Computer Science 2026-05-11 Xiaofeng Liu , Jun Zhang , Fang-Wei Fu

Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…

Information Theory · Computer Science 2017-10-13 Kriangkrai Boonniyom , Somphong Jitman

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…

Number Theory · Mathematics 2019-07-23 José Alves Oliveira , F. E. Brochero Martínez

For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

Let $H_n =\sum\limits_{k=1}^n \frac{1}{k}$ be the $n$-th harmonic number. Euler extended it to complex arguments and defined $H_r$ for any complex number $r$ except for the negative integers. In this paper, we give a new proof of the…

Number Theory · Mathematics 2018-10-24 Tapas Chatterjee , Sonika Dhillon

Using an Euclidean approach, we prove a new upper bound for the number of closed points of degree 2 on a smooth absolutely irreducible projective algebraic curve defined over the finite field $\mathbb F\_q$.This bound enables us to provide…

Algebraic Geometry · Mathematics 2015-10-08 Yves Aubry , Annamaria Iezzi

We study arithmetical and geometrical properties of maximal curves, that is, curves defined over the finite field F_{q^2} whose number of F_{q^2}-rational points reaches the Hasse-Weil upper bound. Under a hypothesis on non-gaps at a…

alg-geom · Mathematics 2008-02-03 Rainer Fuhrmann , Arnaldo Garcia , Fernando Torres

This paper presents a formula for $a$-number of certain maximal curves characterized by the equation $y^{\frac{q+1}{2}} = x^m + x$ over the finite field $\mathbb{F}_{q^2}$. $a$-number serves as an invariant for the isomorphism class of the…

Number Theory · Mathematics 2024-06-28 Behrooz Mosallaei , Sepideh Farivar , Farzaneh Ghanbari , Vahid Nourozi

Some new results on plane F_{q^2}-maximal curves are stated and proved. It is known that the degree d of such curves is upper bounded by q+1 and that d=q+1 if and only if the curve is F_{q^2}-isomorphic to the Hermitian. We show that d\le…

Algebraic Geometry · Mathematics 2007-05-23 Angela Aguglia , Gabor Korchmaros , Fernando Torres

We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…

Information Theory · Computer Science 2013-12-06 Harald Niederreiter , Chaoping Xing
‹ Prev 1 2 3 10 Next ›