Author:
Doğanaksoy Ali,Göloğlu Faruk
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Transactions on Information Theory IT-22, 75–81 (1976)
2. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory IT-23, 337–343 (1977)
3. Soto, J.: Statistical testing of random number generators. In: Proceedings of the 22nd National Information Systems Security Conference, Crystal City, Virginia (1999)
4. Jacquet, P., Szpankowski, W.: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees. Theoretical Computer Science 144 (1995)
5. Lecture Notes in Computer Science;S. Mund,1991
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献