Ergodic Theory Over ${\F}_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 ${\mathbb{Z}}_2$ established by V. Anashin and others. In this paper we present an ergodic theory over ${\F}_2[[T]]$ and some ideas which might be very useful in applications.

18 pages, some typos corrected, exposition improved

Cited by in corpus (3)

• T-functions revisited: New criteria for bijectivity/transitivity
• Ergodicity criteria for non-expanding transformations of 2-adic spheres
• On the characteristic $p$ valued measure associated to Drinfeld discriminant