2-adic shift registers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 809 LNCS, Issue , 1994, Pages 174-178

  Klapper, Andrew ^a   Goresky, Mark ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85006543773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58108-1_21     Document Type: Conference Paper

References (9)

1. J. T. BARROWS Jr., A new method for constructing multiple error correcting linear residue codes, Rep. R-277, Coordinated Sei. Lab., Univ. of Illinois, Urbana, 1966.
2. L. BLUM, M. BLUM, and.M. SNUB, A simple unpredictable pseudo-random number generator, Siam J. Comput. vol. 15, 1986 pp. 364-383.
3. C. F. GAUSS, Disquisitiones Arithmeticae, 1801; reprinted in English translation by Yale Univ. Press, New Haven, CT. 1966.
4. S. GOLOMB Shift Register Sequences. Aegean Park Press, Laguna Hills CA, 1982.
5. D. KNUTH, The Art of Computer Programming, Vol 2. Seminumerical Algorithms. Addison-Wesley, Reading MA, 1981.
6. D. MANDELBAUM, Arithmetic codes with large distance. IEEE Trans. Info. Theory, vol. IT-13, 1967 pp. 237-242.
7. D. MIANDELBAUM, An approach to an arithmetic analog of Berlekamp's algorithm. IEEE Trans. Info. Theory, vol. IT-30, 1984 pp. 758-762.
8. G. MARSAGLIA and A. ZAMAN, A new class of random number generators, Annals of Applied Probability. vol. 1, 1991 pp. 462-480.
9. R. RUEPPEL Analysis and Design of Stream Ciphers. Springer Verlag, New York, 1986.