[图书][B] Handbook of finite fields

GL Mullen, D Panario - 2013 - api.taylorfrancis.com
The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

Mutually orthogonal latin squares based on cellular automata

L Mariot, M Gadouleau, E Formenti… - Designs, Codes and …, 2020 - Springer
We investigate sets of mutually orthogonal latin squares (MOLS) generated by cellular
automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local …

How to securely outsource the extended euclidean algorithm for large-scale polynomials over finite fields

Q Zhou, C Tian, H Zhang, J Yu, F Li - Information Sciences, 2020 - Elsevier
Cloud computing gives resource-constrained clients great conveniences to outsource
exorbitant computations to a public cloud. The extended Euclidean algorithm with large …

Bent functions in the partial spread class generated by linear recurring sequences

M Gadouleau, L Mariot, S Picek - Designs, codes and cryptography, 2023 - Springer
We present a construction of partial spread bent functions using subspaces generated by
linear recurring sequences (LRS). We first show that the kernels of the linear mappings …

Block companion Singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields

SR Ghorpade, S Ram - Finite Fields and Their Applications, 2011 - Elsevier
We discuss a conjecture concerning the enumeration of nonsingular matrices over a finite
field that are block companion and whose order is the maximum possible in the …

Divisibility properties of random samples of integers

JL Fernández, P Fernández - Revista de la Real Academia de Ciencias …, 2021 - Springer
Divisibility properties of random samples of integers | Revista de la Real Academia de Ciencias
Exactas, Físicas y Naturales. Serie A. Matemáticas Skip to main content SpringerLink Account …

On linear sets of minimum size

D Jena, G Van de Voorde - Discrete Mathematics, 2021 - Elsevier
An F q-linear set of rank k, k≤ h, on a projective line PG (1, qh), containing at least one point
of weight one, has size at least qk− 1+ 1 (see De Beule and Van De Voorde (2019)). The …

Constructing orthogonal latin squares from linear cellular automata

L Mariot, E Formenti, A Leporati - arXiv preprint arXiv:1610.00139, 2016 - arxiv.org
We undertake an investigation of combinatorial designs engendered by cellular automata
(CA), focusing in particular on orthogonal Latin squares and orthogonal arrays. The …

Inversion of mutually orthogonal cellular automata

L Mariot, A Leporati - Cellular Automata: 13th International Conference on …, 2018 - Springer
Abstract Mutually Orthogonal Cellular Automata (MOCA) are sets of bipermutive CA which
can be used to construct pairwise orthogonal Latin squares. In this work, we consider the …

Graph components and dynamics over finite fields

R Flynn, D Garton - International Journal of Number Theory, 2014 - World Scientific
GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS Page 1 International Journal
of Number Theory Vol. 10, No. 3 (2014) 779–792 c© World Scientific Publishing Company …