Browse > Article

Perfect Hashing Algorithm Using TPSACA  

김석태 (부경대학교 전자컴퓨터정보통신공학부)
이석기 (부경대학교 정보통신공학과)
최언숙 (영산대학교)
조성진 (부경대학교 자연과학대학 수리과학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.8, no.6, 2004 , pp. 1047-1054 More about this Journal
Abstract
One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.
Keywords
Attractor; TPSACA;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Nandi and P.P. Chaudhuri, Analysis of Periodic and Intermediate Boundary 90/150 Cellular automata, IEEE Trans. Computers, Vol. 45, No 1, pp. 1-12, 1996   DOI   ScienceOn
2 M. Serra, T. Slater, J.C. Muzio and D.M. Miller, The analysis of one dimensional linear cellular automata and their aliasing properties, IEEE Trans Computer-Aided Design, Vol. 9, pp. 767-778, 1990   DOI   ScienceOn
3 S.J. Cho, U.S. Choi and H.D. Kim, Linear nongroup one-dimensional cellular automata characterization on GF(2), J. Korea Multimedia Soc., Vol. 4, No.1, pp. 91-95, 2001
4 A.K. Das and P.P. Chaudhuri, Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation, IEEE Trans. Comput., Vol. 42, pp. 340-352, 1993   DOI   ScienceOn
5 S.J. Cho, H.D. Kim and u.s. Choi, Behavior of Complemented cellular automata derived from a linear cellular automata, Mathematical and Computer Modelling Vol. 36, pp. 979-986, 2002   DOI   ScienceOn
6 S.J. Cho, H.D. Kim and u.s. Choi, Analysis of complemented CA derived from a linear TPMACA, Computers & Mathematics with Applications, Vol. 45. pp. 689-698, 2003   DOI   ScienceOn
7 C. Cook and R. Oldehoeft, More on Minimal Perfect Hash Table, Tech. Report TR-82, 1982
8 P.P. Chaudhuri, D.R. Chowdhury, S. Nandy and Chattopadhyay, Additive Cellular Automata Theory and Application, 1, IEEE Computer Society Press, California, 1997
9 R. Cichelli, Minimal Perfect Hash Functions made simple, Comm. ACM, Vol. 23, pp. 17-19, Jan. 1980   DOI   ScienceOn
10 S. Nandi, B.K. Kar and P.P. Chaudhuri, Theory and Application of Cellular Automata in Cryptography, IEEE Trans. Computers, Vol. 43, pp. 1346-1357, 1994   DOI   ScienceOn
11 A.K. Das and P.P. Chaudhuri, Efficient characterization of cellular automata, Proc. IEE(Part E), Vol. 137, No.1, pp. 81-87, 1990
12 P.H. Bardell, Analysis of cellular auto- mata used as pseudorandom pattern generators, Proc. IEEE int. Test. Conf., pp. 762-767, 1990