Ergodic Theory Over ${\F}_2[[T]]$
Combinatorics
2013-02-21 v3
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 established by V. Anashin and others. In this paper we present an ergodic theory over and some ideas which might be very useful in applications.
Cite
@article{arxiv.1103.2968,
title = {Ergodic Theory Over ${\F}_2[[T]]$},
author = {Dongdai Lin and Tao Shi and Zifeng Yang},
journal= {arXiv preprint arXiv:1103.2968},
year = {2013}
}
Comments
18 pages, some typos corrected, exposition improved