English
Related papers

Related papers: Trace representation and linear complexity of bina…

200 papers

Suppose that $p$ is an odd prime and $\genfrac{(}{)}{}{}{\cdot}{p}$ denotes the Legendre symbol modulo $p$. If $p$ is has the form $p= n^2+1$ then one easily verifies that $\genfrac{(}{)}{}{}{a}{p} = \genfrac{(}{)}{}{}{-a}{p}$ for all $a\in…

Number Theory · Mathematics 2018-08-21 Yemeen Ayub , Charles L. Samuels

This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a…

Symbolic Computation · Computer Science 2024-04-04 Ramachandran Anantharaman , Virendra Sule

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

Number Theory · Mathematics 2019-01-04 Saiying He , James Mc Laughlin

We prove that the Neron-Severi groups of several complex Fermat surfaces are generated by lines. Specifically, we obtain these new results for all degrees up to 100 that are relatively prime to 6. The proof uses reduction modulo a…

Algebraic Geometry · Mathematics 2009-09-30 Matthias Schuett , Tetsuji Shioda , Ronald van Luijk

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…

Cryptography and Security · Computer Science 2007-05-23 Jianqin Zhou

We introduce quaternary Legendre pairs of length $\ell$. In contrast to binary Legendre pairs they can exist for even $\ell$ as well. First we show that they are pertinent to the construction of quaternary Hadamard matrices of order…

Combinatorics · Mathematics 2022-12-22 Ilias S. Kotsireas , Arne Winterhof

Let $\bf T$ be the group of diagonal matrices in $SL_2(\bar{\mathbb{F}}_p)$, where $p$ is a prime number. Let $\Bbbk$ be an algebraically closed field of characteristic not equal to $2$ and $p$. We classify all the irreducible…

Representation Theory · Mathematics 2026-03-17 Junbin Dong

We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…

General Mathematics · Mathematics 2019-01-28 Kunle Adegoke

We construct two new infinite families of trace codes of dimension $2m$, over the ring $\mathbb{F}_p+u\mathbb{F}_p,$ when $p$ is an odd prime. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by…

Information Theory · Computer Science 2017-09-18 Minjia Shi , Yue Guan , Patrick Sole

The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…

Information Theory · Computer Science 2020-07-31 Minghui Yang , Keqin Feng

In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…

Information Theory · Computer Science 2023-03-17 Hongwei Liu , Zihao Yu

Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…

Symbolic Computation · Computer Science 2024-07-29 Hans Zantema

We determine the exact values of the linear complexity of 2p-periodic quaternary sequences over Z_4 (the residue class ring modulo 4) defined from the generalized cyclotomic classes modulo 2p in terms of the theory of of Galois rings of…

Number Theory · Mathematics 2016-03-17 Zhixiong Chen , Vladimir Edemskiy

We present an algorithm for computing the set of all coset leaders of a binary code $\mathcal C \subset \mathbb{F}_2^n$. The method is adapted from some of the techniques related to the computation of Gr\"obner representations associated…

Information Theory · Computer Science 2010-01-29 M. Borges-Quintana , M. A. Borges-Trenard , E. Martinez-Moro

We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…

Combinatorics · Mathematics 2007-05-23 Brad Jackson , Frank Ruskey

Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…

Number Theory · Mathematics 2024-09-25 Kaimin Cheng , Shuhong Gao

In this paper, we consider Legendre trajectories of trans-$S$-manifolds. We obtain curvature characterizations of these curves and give a classification theorem. We also investigate Legendre curves whose Frenet frame fields are linearly…

Differential Geometry · Mathematics 2022-02-01 Şaban Güvenç

Following what Barthel-Livn\'e and Breuil made for GL(2,F), we study mod $p$ representations of SL(2,F) for F a complete non-archimedean local field of residual characteristic p and with finite residue field. In particular, we link these…

Representation Theory · Mathematics 2024-02-16 Ramla Abdellatif

We study a certain family of finite-dimensional simple representations over quantum affine superalgebras associated to general linear Lie superalgebras, the so-called fundamental representations: the denominators of rational $R$-matrices…

Quantum Algebra · Mathematics 2016-07-20 Huafeng Zhang

The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…

Number Theory · Mathematics 2016-06-22 László Mérai , Harald Niederreiter , Arne Winterhof