Pseudo Random Sequences and Arrays

Proceedings of the IEEE

Volumn 64, Issue 12, 1976, Pages 1715-1729

  Macwilliams, F Jessie ^a   Sloane, Neil J A ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - CORRELATION THEORY;

COMPUTER METATHEORY;

EID: 0017218087     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1976.10411     Document Type: Article

References (87)

1. J. D. AIanen and D. E. Knuth, “Tables of finitefields,” Sunkhya, Series A,vol. 26, pp. 305-328,1964.
2. J. R. Ball, A. H. Spittle, and H. T. Liu, “High-speed m-sequence generation: a further note,” Electron. Lett., vol. 11, pp. 107–108, 108, 1975.
3. C. Balza, A. Fromageot, and M. Maniere, “Four-level pseudorandom sequences,” Electron. Lett., vol. 3, pp. 313–315, 1967.
4. T. C. Bartee and D. I. Schneider, “Computation with finite fields,” Infom. Contr., vol. 6, pp. 79–98, 1963.
5. L. D. Baumert, “Cyclic Hadamard matrices,” JPL Space Programs Summary, vol. 37-43-IV, pp. 311–314 and 338, 1967.
6. J. T. B. Beard, Jr., “Computing in GF(q),“ Math. Comput., vol. 28, pp. 1159–1166, 1974.
7. J. T. B. Beard, Jr., and K. I. West, “Some primitive polynomials of the third kind,” Math. Comput, vol. 28, pp. 1166–1167, 1974.
8. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
9. “Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by Hadamard smearing,” Bell Syst. Tech. J., vol. 49, pp. 969–986, 1970.
10. E. R. Berlekamp and J. Justesen, “Some long cyclic linear binary codes are not so bad,” IEEE Trans. Inform. Theory, vol. 20, pp. 351–356, 1974.
11. P. A. N. Briggs and K. R. Godfrey, “Autocorrelation function of a 4-level m-sequence,” Electron. Lett., vol. 4, 232–233, 1963.
12. N. G. de Bruijn, “A combinatorial problem,” Nederl. Akad. Wetensch. Proc. Ser. A., vol. 49, pp. 758–764, 1946-Indag. Math., vol. 8, pp. 461–467, 1946.
13. D. Calabro and J. K. Wolf, “On the synthesis of two-dimensional arrays with desirable correlation properties,” Imform. Contr., vol. 11, pp. 537–560, 1968.
14. D. E. Carter, “On the generation of pseudo-noise codes,” IEEE Trans. Aerosp. Electron. Syst, vol. 10, pp. 898–899, 1974.
15. J. A. Chang, “Generation of 5-level maximal-length sequences,” Electron. Lett, vol. 2, p. 258, 1966.
16. J. H. Conway, “A tabulation of some information concerning finite fields,” Computers in Mathematical Research, R. F. Churchhouse and J. C. Herz, Eds. Amsterdam: North-Holland, 1968, pp. 37–50.
17. I. G. Cumming, “Autocorrelation function and spectrum of a filtered, Pseudo Random binary sequence,” Proc. Inst. Elec. Eng. vol. 114, pp. 1360–1362, 1967.
18. J. F. ‘Dillon, “Elementary Hadamard difference sets,” Ph.D. dissertation, Univ. Maryland, College Park. 1974.
19. J. V. Evans and T. Hagfors, Eds., Radar Astronomy. New York: McGraw-Hill, 1968.
20. H. Feistel, W. A. Notz, and J. L. Smith, “Some cryptographic techniques for machine-to-machine data communications,” Proc. IEEE, vol. 63, pp. 1545–1554, 1975.
21. J. P. Fillmore and M. L. Marx, “Linear recursive sequences,” SIAM Review, vol. 10, pp. 342–353, 1968.
22. H. Fredricksen, “The lexicographically least de Bruijn cycle,” J. Combinatorial Theory, vol. 9, pp. 1–5, 1970.
23. H. Fredricksen, “A class of nonlinear de Bruijn cycles,” J. Combinatorial Theory, vol. 19A, pp. 192–199, 1975.
24. S. Fredricsson, “Pseudo Randomness properties of binary shift register sequences,” IEEE Trans. Inform. Theory, vol. 21, pp. 1975.
25. P. R. Geffe, “An open letter to communication engineers,” Proc. IEEE, vol. 55, p. 2173, 1967.
26. “How to protect data with ciphers that are really hard to break,” Electronics, vol. 46, pp. 99–101, Ian. 1973.
27. E. N. Gilbert, unpublished.
28. A. Gill, Linear Sequential Circuits. New York: McGraw-Hill, 1966.
29. K. R. Godfrey, “Three-level m-sequences,” Electron. Lett., vol. 2, pp. 241–243, 1966.
30. J.M. Goethals, Factorization of cyclic codes, IEEE Trans. Inform. Theory, vol. 13, pp. 242–246, 1967.
31. R. Gold, Characteristic linear sequences and their coset functions, SIAM J. Appl. Math., vol. 14, pp. 980–985, 1966.
32. S. W. Golomb, Ed., Digital Communications with Space Applications. Englewood Cliffs, N.J.,: Prentice-Hall, 1964.
33. S. W. Golomb, Shift Register Sequences. San Francisco: Holden-Day, Day, 1967.
34. B. Gordon, “On the existence of perfect maps,” IEEE Trans. Inform. Theory, vol. 12, pp. 486–487, 1966.
35. D. Gorenstein and E. Weiss, “An acquirable code,” Inform. Contr., vol. 7, pp. 315–319, 1964.
36. D. H. Green and I. S. Taylor, “Irreducible polynomials over composite Galois fields and their applications in coding techniques,” Proc. Inst. Elec. Eng., vol. 121, pp. 935–939, 1974.
37. R. R. Green, “A serial orthogonal decoder,” JPL Space Programs Summary, vol. 37-39-IV, pp. 247–253, 1966.
38. “Analysis of a serial orthogonal decoder,” JPL Space Programs Summary, vol. 37-53-111, pp. 185–187, 1968.
39. M. Hall, Jr., Combinatorial-Theory. Waltham, MA: Blaisdell, 1967.
40. J. T. Harvey, “High-speed m-sequence generation,” Electron. Lett., vol. 10, pp. 480–481, 1974.
41. M. Harwit, “Spectrometric imager,” Applied Optics, vol. 10, pp. 1415–1421, 1971, and vol. 12, pp. 285–288, 1973.
42. private communication.
43. U. Henriksson, “On a scrambling property of feedback shift registers,” IEEE Trans. Commun., vol. 20, pp. 998–1001, 1972.
44. T. Ikai and Y. Kojiraa, “Two-dimensional cyclic codes,” Electron. Commun. in Japan, vol. 57-A, pp. 27–35, 1974.
45. H. Imai, “Two-dimensional Fire codes,” IEEE Trans. Inform. Theory, Vol. 19, pp. 796–806, 1973.
46. W. H. Kautz, Ed., Linear Sequential Switching Circuits: Selected Papers. San Francisco: Holden-Day, 1965.
47. K. Knowlton, private communication.
48. D. E. Knuth, The Art of Computer Programming. Reading, MA.: Addison-Wesley, 1968, vol. 1, p. 379.
49. Y. I. Kotov, “Correlation function of composite sequences constructed from two M-sequences,” Radio Eng. Electron. Pays., vol. 19, pp. 128–130, 1974.
50. J. Lindner, “Binary sequences up to length 40 with best possible autocorrelation function,” Electron. Len., vol. 11, p. 507, 1975.
51. F. J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Correcting Codes. Amsterdam: North-Holland Publishing, to appear.
52. R. L. McFarland, “A family of difference sets i n noncyclic groups,” J. Combinatorial Theory, vol. 15 A, pp. 1–10, 1973.
53. K. Nakamura and Y. Iwadare, “Data Scramblers for multilevel pulse sequences,” NEC Research and Development, No. 26, pp. 53–63, July 1972.
54. I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers. New York: Wiley, 1966, 2nd edition.
55. T. Nomura and A. Fukuda, “Linear recurring planes and two-dimensional dimensional cyclic codes,” Electron. Commun. in Japan, vol. 54A, pp. 23–30, 1971.
56. T. Nomura, H. Miyakawa, H. Imai, and A. Fukuda, “A method of construction and some properties of planes having maximum area matrix,” Electron. Commun. in Japan, vol. 54A, pp. 18–25, 1971.
57. “Some properties of the 70-plane and its extension to three-dimensional dimensional space,” Electron. Commun. in Japan, vol. 54A, pp. 27–34, 1971.
58. “A Theory of two-dimensional linear recurring arrays,” IEEE Trans. Inform. Theory, vol. 18, pp. 775–785, 1972.
59. W. W. Peterson and E. J. Weldon, Error-Correcting Codes. Cambridge, MA: M. I. T. Press, 1972, 2nd ed.
60. G. H. Pettengill, Radar Handbook, M. I. Skolnik, Ed. New York: McGraw-Hill, 1970, Ch. 33.
61. E. C. Posner, “Combinatorial Structures” in Planetary Reconnais-sance, in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1969, pp. 15–46.
62. I. S. Reed and R. M. Stewart, “Note on the existence of perfect maps,” IEEE Trans. Inform. Theory, vol. 8, pp. 10–12, 1962.
63. P. D. Roberts and R. H. Davis, “Statistical properties of smoothed maximal-length linear binary sequences,” Proc. Inst. Elec. Eng., vol. 113, pp. 190–196, 1966.
64. 0. S. Rothaus, “On ‘Bent’ Functions,” J. Combinatorial Theory, vol. 20A, pp. 300–305, 1976.
65. J. E. Savage, “Some simple self-synchronizing digital data scramblers,” Bell Syst Tech. J., vol. 46, pp. 449–487, 1967.
66. P. H. R. Scholefield, “Shift registers generating maximum-length sequences,” Electron. Technol., vol. 37, pp. 389–394, 1960.
67. M. R. Schroeder, “Sound diffusion by maximum-length sequences,” J. Acaust. Soc. Am., vol. 57, pp. 149–150, 1975.
68. E. S. Selmer, “Linear recurrence relations over finite fields,” Dept. of Math., Univ. of Bergen, Norway, 1966.
69. N. J. A. Sloane, T. Fine, P. G. Phillips, and M. Hanvit, “Codes for Multislit Spectrometry,” App J. Opt., vol. 8, pp. 2103–2106, 1969.
70. N. J. A. Sloane and M. Harwft, “Masks for Hadamard transform optics, and weighing designs,” Appl. Opt., vol. 15, pp. 107–114, 1976.
71. R. Spann, “A Two-Dimensional correlation property of Pseudo Random maximal-length sequences,” Proc. IEEE, vol. 53, p. 2137, 1963.
72. W. Stahnke, “Primitive binary polynomials,” Math. Comput., vol. 27, pp. 977–980, 1973.
73. J. J. Stiffler, Theory of Synchronous Communications. Englewood Cliffs, NS: Prentice-Hall, 1971.
74. M. H. Tai, M. Harwit, and N. J. A. Sloane, “Errors in Hadamard spectroscopy or imaging caused by imperfect masks,” App J. Opt., vol. 14, pp. 2678–2686, 1975.
75. R. Theone and S. W. Golomb, “Search for cyclic Hadamard matrices,” JPL Space Programs Summary, vol. 37-40-IV, pp. 207–208, 1966.
76. S. A. Tretter, “Properties of PN 2 sequences,” IEEE Trans. Inform. Theory, vol. 20, pp. 295–297, 1974.
77. S. H. Tsao, “Generation of delayed replicas of maximal-length linear binary sequences,” Proc. Inst. Elec. Eng., vol. 111, pp. 1803–1806, 1964.
78. R. Turyn, “Sequences with small correlation,” in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1969, pp. 195–228.
79. J. V. Uspensky and M. A. Heaslet, Elementary Number Theory. New York: McGraw-Hill, 1939.
80. W. D. Wallis, A. P. Street, and J. S. Wallis, “Combinatorics: Room squares, sum-free sets, Hadamard matrices,” Lecture Notes in Mathematics 292. Berlin: Springer, 1972.
81. G. D. Weathers, E. R. Graf, and G. R. Wallace, “The subsequence weight distribution of summed maximum length digital sequences,” IEEE Trans. Commun., vol. 22, pp., 997–1004, 1974.
82. L. R. Welch, “Computation of finite Fourier series,” JPL Space Programs Summary, vol. 37-37-IV, pp. 295–297, 1966.
83. L. J. Weng, “Decomposition of M-sequences and its applications,” IEEE Trans. Inform. Theory, vol. 17, pp. 457–463, 1971.
84. M. Willett, “The index of an m-sequence,” SIAM,I. App J. Math., vol. 25, pp. 24–27, 1973.
85. N. Zierler, “Linear recurring sequences,” J. Soc. Ind. App J. Math., vol. 7, pp. 31–48, 1959.
86. “Linear recurring sequences and error-correcting codes,” Error Correcting Codes, H. B. Mann, Ed., New York: Wiley, 1969, pp. 47–59.
87. N. Zierler and J. Brillhart, “On primitive trinomials (mod 2),” Inform. Cont., vol. 13, pp. 541–554, 1968, and vol. 14, pp. 56 6 –569, 569, 1969.