Vectorial FCSR constructed on totally ramified extension of the p-adic numbers

2011/12/29 by Marjane, Abdelaziz
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1112.6210

Abstract

In this paper, we introduce a vectorial conception of d-FCSRs to build these registers over any finite field. We describe the structure of d-vectorial FCSRs and we develop an analysis to obtain basic properties like periodicity and the existence of maximal length sequences. To illustrate these vectorial d-FCSRs, we present simple examples and we compare with those of Goresky, Klapper and Xu. Keywords: LFSR, FCSR, vectorial FCSR, d-FCSR, sequences, periodicity, p-adic, ?-adic, maximal period.

Related

• Covering arrays from maximal sequences over finite fields
• CRT and Fixed Patterns in Combinatorial Sequences
• Convergence of generalized Collatz problem in k-adic field
• Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields
• Linear Recurrences over a Finite Field with Exactly Two Periods