On an Improvement of a Result by Niederreiter and Wang Concerning the Expected Linear Complexity of Multisequences
Abstract
We show that the expected value for the linear complexity of m-multisequences of length n is En(m) = n m/(m+1) + O(1).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.