Multisequences with high joint nonlinear complexity
Wilfried Meidl, Harald Niederreiter

TL;DR
This paper introduces the concept of joint nonlinear complexity for multisequences over finite fields, analyzes specific families, and studies the probabilistic behavior of random multisequences' complexity.
Contribution
It presents a new measure for multisequences, analyzes explicit families, and provides probabilistic insights into the complexity of random multisequences.
Findings
Explicit analysis of joint nonlinear complexity for two multisequence families
Probabilistic results on the behavior of complexity in random multisequences
Introduction of a novel complexity measure for multisequences
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cellular Automata and Applications · Cryptography and Residue Arithmetic
