Multisequences with high joint nonlinear complexity

DOI10.1007/S10623-015-0142-YMaRDI QIDQ306345zbMATHOpenAlexFDO

Authors Wilfried Meidl, Harald Niederreiter

Publication date 31 August 2016

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.2348

zbMATH Keywords

sequencespseudorandom number generationmultisequencesnonlinear complexity

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Pseudo-random numbers; Monte Carlo methods (11K45)

Abstract: We introduce the new concept of joint nonlinear complexity for multisequences over finite fields and we analyze the joint nonlinear complexity of two families of explicit inversive multisequences. We also establish a probabilistic result on the behavior of the joint nonlinear complexity of random multisequences over a fixed finite field.

Recommendations

• On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences
• On the joint linear complexity profile of explicit inversive multisequences
• On the Joint Linear Complexity of Linear Recurring Multisequences
• The Probabilistic Theory of the Joint Linear Complexity of Multisequences
• Improved results on the probabilistic theory of the joint linear complexity of multisequences

Cites work

• scientific article; zbMATH DE number 1583787 (Why is no real title available?)
• scientific article; zbMATH DE number 4191554 (Why is no real title available?)
• scientific article; zbMATH DE number 3176450 (Why is no real title available?)
• scientific article; zbMATH DE number 53676 (Why is no real title available?)
• scientific article; zbMATH DE number 1996484 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• An approximate distribution for the maximum order complexity
• Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
• Multisequences with almost perfect linear complexity profile and function fields over finite fields
• Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
• On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences
• On the joint linear complexity profile of explicit inversive multisequences
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• On the linear complexity profile of some new explicit inversive pseudorandom numbers
• Sequences With High Nonlinear Complexity
• Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
• The Maximum Order Complexity of Sequence Ensembles

Cited in

(8)

• Nonlinear complexity and Weierstrass semigroup of two rational points on a Hermitian curve
• Sequences With High Nonlinear Complexity
• Constructing sequences with high nonlinear complexity using the Weierstrass semigroup of a pair of distinct points of a Hermitian curve
• Finite length sequences with large nonlinear complexity
• On the joint linear complexity profile of explicit inversive multisequences
• Generalized Multiplexed Sequences
• The asymptotic behavior of the joint linear complexity profile of multisequences
• On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences

This page was built for publication: Multisequences with high joint nonlinear complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306345)