The Space Complexity of Generating Tent Codes

Naoaki Okada, Shuji Kijima

This paper is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it possible to get the $n$-th bit of a bit sequence generated by…