Construction of sequences with high Nonlinear Complexity from the Hermitian Function Field

09/17/2019
by   Alonso S. Castellanos, et al.
0

We provide a sequence with high nonlinear complexity from the Hermitian function field H over F_q^2. This sequence was obtained using a rational function with pole divisor in certain ℓ collinear rational places on H, where 2 ≤ℓ≤ q. In particular we improve the lower bounds on the kth-order nonlinear complexity obtained by H. Niederreiter and C. Xing; and O. Geil, F. Özbudak and D. Ruano.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/20/2019

A new construction of nonlinear codes via rational function fields

It is well known that constructing codes with good parameters is one of ...
research
06/20/2018

Effective Divergence Analysis for Linear Recurrence Sequences

We study the growth behaviour of rational linear recurrence sequences. W...
research
01/29/2020

Multisequences with high joint nonlinear complexity from function fields

Multisequences over finite fields play a pushing role in the application...
research
09/15/2022

Locally recoverable codes from towers of function fields

In this work we construct sequences of locally recoverable AG codes aris...
research
04/02/2018

Pure gaps on curves with many rational places

We consider the algebraic curve defined by y^m = f(x) where m ≥ 2 and f(...
research
08/04/2021

An estimate of approximation of an analytic function of a matrix by a rational function

Let A be a square complex matrix; z_1, ..., z_N∈ℂ be arbitrary (possibly...
research
06/24/2022

The role of rationality in integer-programming relaxations

For a finite set X ⊂ℤ^d that can be represented as X = Q ∩ℤ^d for some p...

Please sign up or login with your details

Forgot password? Click here to reset