Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Paper
HEURISTIC APPROACH FOR FINDING ASYMPTOTICALLY RANDOM GFSR GENERATORS.
Abstract
A heuristic approach for finding asymptotically random GFSR generators is proposed. The basic idea of this approach is the use of random search at the construction of generator matrices for asymptotically random GFSR sequences. By using this approach, five 31-bit asymptotically random GFSR generators with a prime period, 212**7 minus 1, were efficiently found.
Related
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997