I. S. Reed
- 1 PETERSON, W.W. Error-Correcting Codes. MIT Press and Wiley, New York, 1961.Google Scholar
- 2 KAVTZ, W. H. (Ed.) Linear Sequential Switching Circuits. Holden-Day, San Francisco, 1965.Google Scholar
- 3 GILL, A. Linear Sequential Circuits. McGraw-Hill, New York, 1966.Google Scholar
- 4 GOLOMB, S.W. Shift Register Sequences. Holden-Day, San Francisco, 1967. Google Scholar
- 5 MAGELBY, K.B. The synthesis of nonlinear feedback shift registers. Tech. Rep. No. 6207- 1, Syst. Theory Lab., Stanford U., Palo Alto, Calif., Oct. 1963.Google Scholar
- 6 GOLD, R. Optimal binary sequences for spread spectrum multiplexing. IEEE Trans. IT-13 (Oct. 1967), 619-621.Google Scholar
- 7 ----. Maximal recursive sequences with 3-valued recursive cross-correlation functions. IEEE Trans. IT-i (Jan. 1968), 1154-1156.Google Scholar
- 8 GILL, A. Time-varyingsequential machines. J. Franklinlnst. 276, 6 (Dec. 1963), 519-539.Google Scholar
- 9 BARAN, PAUL. On distributed communications: IX. Security, secrecy, and tamper-free considerations. RM-3765-PR, The Rand Corp., Santa Monica, Calif., Aug. 1964.Google Scholar
- 10 REED, I. A general viewpoint on shift-register sequences. RM-3874-PR, The Rand Corp., Santa Monica, Calif., Oct. 1963.Google Scholar
- 11 PETERSoN, H. E., AND TURN, R. System implications of information privacy. Proc. AFIPS 1967 Fall Joint Comput. Conf., Vol. 30, Spartan Books, New York, pp. 656-715.Google Scholar
- 12 BARAN, PAUL. Communications, computers and people. Proc. AFIPS 1965 Fall Joint Comput. Conf., Vol. 27, Pt. 2, Thompson Book Co., Washington, D.C., pp. 45-50.Google Scholar
- 13 HALL, M., Jm Theory of Groups, MacMillan, New York, 1959.Google Scholar
- 14 LORENS, C.S. Invertible Boolean functions. IEEE Trans. EC-13 (Oct. 1964), 529-541.Google Scholar
Index Terms
- A Generalization of Shift-Register Sequence Generators
Recommendations
Shift-register sequence random number generators on the hypercube conurrent computers
C3P: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2We discuss the design of a class of shift-register sequence random number generators for the MIMD parallel computers, and particularly for the hypercube concurrent computers. The simplest implementation is to have each processor generating its own ...
Cryptanalytic Attack on Cryptographic Sequence Generators: The Class of Clock-Controlled Shrinking Generators
ICCSA '08: Proceedings of the international conference on Computational Science and Its Applications, Part IIThe shrinking generator is a very popular sequence generator with cryptographic applications. Nowadays, it is still considered as a secure keystream generator. In this work, it is shown that the knowledge of only a low number of generated bits is ...
Error performances of multi shift-register convolutional self-doubly-orthogonal codes
A class of orthogonal convolutional codes using a multi shift-register encoder and featuring self-doubly-orthogonal properties is analyzed under iterative decoding. The lower bounds of error performances of these codes can be approached within typically ...
Comments