Ergodic Theory Over 2[[T]]
Abstract
In cryptography and coding theory, it is important to study the pseudo-random sequences and the ergodic transformations. We already have the 1-Lipshitz ergodic theory over 2 established by V. Anashin and others. In this paper we present an ergodic theory over 2[[T]] and some ideas which might be very useful in applications.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.