Signal design for good correlation: For wireless communication, cryptography, and radar

Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar

Volumn 9780521821049, Issue , 2005, Pages 1-440

  Golomb, Solomon W ^a   Gong, Guang ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR TELEPHONE SYSTEMS; CRYPTOGRAPHY; DIGITAL COMMUNICATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; RADAR; SONAR; WIRELESS TELECOMMUNICATION SYSTEMS;

APPLICATION AREA; CORRELATION PROPERTIES; DIGITAL COMMUNICATIONS; DIGITAL SIGNALS; GOOD CORRELATIONS; INTERNET TRANSACTION; SECURE AUTHENTICATIONS; WIRELESS COMMUNICATIONS;

CODE DIVISION MULTIPLE ACCESS;

EID: 84929714331     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511546907     Document Type: Book

References (198)

1. K. T. Arasu and K. J. Player. A new family of cyclic difference sets with singer parameters in characteristic three, Designs, Codes and Cryptography 28 (2003), pp. 75-91.
2. R. H. Barker. Group synchronization of binary digital systems, Communication Theory (Proceedings of the Second London Symposium on Information Theory), London, Butterworths, 1953, pp. 273-287.
3. L. D. Baumert. Cyclic Difference Sets, Lecture Notes in Mathematics, Vol. 182, Berlin, Springer-Verlag, 1971.
4. L. D. Baumert, S. W. Golomb, and Marshall Hall, Jr. Discovery of an Hadamard matrix of order 92, Bull. Amer. Math. Soc. 11 (1962), pp. 237-238.
5. J. K. Beard, K. Erickson, and J. C. Russo. Combinatoric collaboration on Costas arrays and radar applications, Proceedings of the 2004 IEEE Radar Conference, Piscataway, NJ, USA, 2004, pp. 260-265.
6. H. Beker and F. Piper. Cipher Systems, John Wiley and Sons, New York, 1982.
7. A. Bekin. On the nonexistence of additional counterexamples to S. Piccard's Theorem, Ph.D. Dissertation, University of Southern California, Los Angeles, December 2004.
8. E. R. Berlekamp. Algebraic Coding Theory, New York, McGraw-Hill, 1968.
9. B. C. Berndt and R. J. Evans. Sums of Gauss, Jacobi and Jacobsthal, J. Number Theory 11 (1979), pp. 349-398.
10. B. C. Berndt, R. J. Evans, and K. S. Williams. Gauss and Jacobi Sums, New York, John Wiley, Interscience, 1998.
11. T. Beth, D. Jungnickel, and H. Lenz. Design Theory, Cambridge, Cambridge University Press, Vol. 1, 2nd Edition 1999, p. 305.
12. H. S. Black. Modulation Theory, New York, Van Nostrand, 1953.
13. S. Bloom and S.W. Golomb. Applications of numbered, undirected graphs, Proceedings of the IEEE 65 (1977), pp. 562-570.
14. S. Boztas and P. V. Kumar. Binary sequences with Gold-like correlation but larger linear span, IEEE Trans. Inform. Theory 40 (1994), pp. 532-537.
15. A. R. Brenner. Polyphase Barker sequences up to length 45 with small alphabets, Electronics Letters 34 (1998), pp. 1576-1577.
16. A. J. Butrica. To See the Unseen: A History of Planetary Radar Astronomy, National Aeronautics and Space Administration, Washington DC, 1996.
17. P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On correlation-immune functions, Advances in Cryptology-Crypto’91, Lecture Notes in Computer Science, Vol. 576, Berlin, Springer-Verlag, 1992, pp. 86-100.
18. A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine. On cryptographic properties of the cosets of R(1, m), IEEE Trans. Inform. Theory 47 (2001), pp. 1494-1513.
19. A. Canteaut, P. Charpin, and H. Dobbertin. Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture, IEEE Trans. Inform. Theory 46 (2000), pp. 4-8.
20. C. Carlet. A larger class of cryptographic Boolean functions via a study of the Maiorana- McFarland construction, Advances in Cryptology-Crypto’2002, Lecture Notes in Computer Science, Vol. 2442, Berlin, Springer-Verlag, 2002, pp. 549-564.
21. C. Carlet. Two new classes of bent functions, Advances in Cryptology-Eurocrypt’93, Lecture Notes in Computer Science, Vol. 765, Berlin, Springer-Verlag, 1994, pp. 77-101.
22. C. Carlet, P. Charpin, and V. Zinoviev. Codes, bent functions and permutations suit able for DES-like cryptosystems, Designs, Codes and Cryptography 15 (1998), pp. 125-156.
23. A. H. Chan and R. A. Games. On the quadratic spans of de Bruijn sequences, IEEE Trans. Inform. Theory 36 (1990), pp. 822-829.
24. A. H. Chan, R. A. Games, and E. L. Key. On the complexities of de Bruijn sequences, J. Combin. Theory 33 (1982), pp. 233-246.
25. A. C. Chang, P. Gaal, S. W. Golomb, G. Gong, T. Helleseth, and P. V. Kumar. On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code, IEEE Trans. Inform. Theory 46 (2000), pp. 680-686.
26. A. C. Chang, S. W. Golomb, G. Gong, and P. V. Kumar. On the linear span of ideal autocorrelation sequences arising from the Segre hyperoval, Sequences and their Applications - Proceedings of SETA’98, Discrete Mathematics and Theoretical Computer Science, London, Springer-Verlag, 1999.
27. U. J. Cheng. Exhaustive construction of (255, 127, 63)-cyclic difference sets, Jounal of Combinatorial Theory, Series A 33 (1983), pp. 115-125.
28. D. C. Chu. Polynominal codes with good periodic correlation properties, IEEE Trans. Inform. Theory 18 (1972), pp. 531-532.
29. H. B. Chung and J. S. No. Linear span of extended sequences and cascaded GMW sequences, IEEE Trans. Inform. Theory 45 (1999), pp. 2060-2065.
30. S. D. Cohen and R. W. Matthews. A class of exceptional polynomials, Transactions of the American Mathematical Society 345 (1994), pp. 897-909.
31. J. P. Costas. A study of a class of detection waveforms having nearly ideal range-doppler ambiguity properties, Proc. IEEE 72 (1984), pp. 996-1009.
32. T. W. Cusick and H. Dobbertin. Some new three-valued crosscorrelation functions for binary m-sequences, IEEE Trans. Inform. Theory 42 (1996), pp. 1238-1240.
33. Z. D. Dai, G. Gong, and D. F. Ye. Decompositions of cascaded GMW functions, Science in China (Series A) 44 (2001), pp. 709-717.
34. M. H. Dawson and S. E. Tavares. An expanded set of s-box design criteria based on information theory and its relation to differential-like attacks, Advances in Cryptology- Eurocrypt’91, Lecture Notes in Computer Science, Vol. 547, Berlin, Springer-Verlag, 1991, pp. 352-367.
35. J. F. Dillon. Multiplicative difference sets via additive characters, Designs, Codes and Cryptography, 17 (1999), pp. 225-236.
36. J. F. Dillon. Elementary Hadamard difference sets, in Proc. Sixth S-E Conf. Comb. Graph Theory and Comp., F. Hoffman et al. (Eds.), Winnipeg Utilitas Math, 1975, pp. 237-249.
37. J. F. Dillon and H. Dobbertin. New cyclic difference sets with Singer parameters, Finite Fields and Their Applications, 10 (2004), pp. 342-389.
38. C. S. Ding, T. Helleseth, and W. J. Shan. On the linear complexity of Legendre sequences, IEEE Trans. Inform. Theory 44 (1998), pp. 1276-1278.
39. S. S. Ding, Linear Feedfack Shift Register Sequences, Shanghai, Scientific and Technology Publications, 1982, Chap. 1. (In Chinese)
40. H. Dobbertin. Another proof of Kasami's theorem, Designs, Codes, and Cryptography, 17 (1999), pp. 177-180.
41. H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity, Proceedings of Fast Software Encryption, Second International Workshop, Berlin, Springer-Verlag, 1995, pp. 61-74.
42. H. Dobbertin. Kasami power functions, permuation polynomials and cyclic difference sets, Difference sets, sequences and their correlation properties (Bad Windsheim, 1998), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 542 (1999), pp. 133-158.
43. H. Dobbertin, T. Helleseth, P. V. Kumar, and H. Martinsen. Ternary m-sequences with three-valued cross-correlation functions: new decimations of Welch and Niho type, IEEE Trans. Inform. Theory 47 (2001), pp. 1473-1481.
44. A. Dollas, W. T. Rankin, and D. McCracken. A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler, IEEE Trans. Inform. Theory 44 (1998), pp. 379-382.
45. R. B. Dreier and K. W. Smith. Exhaustive determination of (511, 255, 127) cyclic difference sets, manuscript, 1991.
46. T. Etzion and A. Lempel. Construction of de Bruijn sequences of minimal complexity, IEEE Trans. Inform. Theory 30 (1984), pp. 705-709.
47. R. Evan, H. D. L. Hollman, C. Krattenthaler, and Q. Xiang. Gauss sums, Jacobi sums and p-ranks of cyclic difference sets, Journal of Combinatorial Theory, Series A 87 (1999), pp. 74-119.
48. R. Fano. Transmission of Information, Cambridge, MIT Press, 1961.
49. Fibonacci, Liber Abaci, 1202. English translation by L. E. Sigler, Springer-Verlag, New York, 2002.
50. R. L. Frank. Polyphase codes with good nonperiodic correlation properties, IEEE Trans. Inform. Theory 9 (1963), pp. 43-45.
51. P. Gaal and S. W. Golomb. Exhaustive determination of (1023, 511, 255)-cyclic difference sets, Mathematics of Computation 70 (2001), pp. 357-366.
52. R. Gallager. Information Theory and Reliable Communication, New York, John Wiley and Sons, 1968.
53. R. A. Games. An algebraic construction of sonar sequences using M-sequences, SIAM J. Algebraic Discrete Methods 8 (1987), pp. 753-761.
54. R. A. Games. Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial, Discrete Appl. Math. 12 (1985), pp. 139-146.
55. R. A. Games. A generalized recursive construction for de Bruijn sequences, IEEE Trans. Inform. Theory 29 (1983), pp. 843-850.
56. R. A. Games. The geometry of m-sequences: three-valued crosscorrelations and quadratics in finite projective geometry, SIAM J. Algebraic Discrete Methods 7 (1986), pp. 43-52.
57. R. A. Games. The geometry of quadrics and correlations of sequences, IEEE Trans. Inform. Theory 32 (1986), pp. 423-426.
58. R. A. Games. There are no de Bruijn sequences of span n with complexity 2n—1 + n + 1, J. Combin. Theory, Ser. A 34 (1983), pp. 248-251.
59. R. A. Games and A. H. Chan. A fast algorithm for determining the complexity of a binary sequence with period 2n, IEEE Trans. Inform. Theory 29 (1983), pp. 144-146.
60. M. Gardner. Wheels, Life and Other Mathematical Amusements, New York, W. H. Freeman, 1983, Chap. 15, pp. 152-165.
61. D. G. Glynn, Two new sequences of ovals in finite Desarguesian planes of even order, Lecture Notes in Mathematics, Vol. 1036, Berlin, Springer-Verlag, 1983, pp. 217-229.
62. R. Gold. Maximal recursive sequences with 3-valued recursive cross-correlation functions, IEEE Trans. Inform. Theory 14 (1968), pp. 154-156.
63. S. W. Golomb. Algebraic constructions for Costas arrays, Journal Comb. Theory (A) 37 (1984), pp. 13-21.
64. S. W. Golomb. Irreducible polynomials, synchronization codes, primitive necklaces, and the cyclotomic algebra, Combinatorial Mathematics and Its Applications, R. C. Bose and T. A. Dowling (Eds.), Chapel Hill, University of North Carolina, 1969, pp. 358-370.
65. S. W. Golomb. On the classification of balanced binary sequences of period 2n — 1, IEEE Trans. Inform. Theory 26 (1980), pp. 730-732.
66. S. W. Golomb. On the classification of Boolean functions, IEEE Trans. Inform. Theory 5 (1959), pp. 176-186. Also appears in Golomb (1982), Chap. VIII.
67. S. W. Golomb. Sequences with Randomness Properties, Baltimore, Glenn L. Martin Company, 1955.
68. S. W. Golomb. Shift Register Sequences, San Francisco, Holden-Day, 1967, revised edition, Laguna Hills, CA, Aegean Park Press, 1982.
69. S. W. Golomb. Two-valued sequences with perfect periodic autocorrelation, IEEE Trans. Aerospace Electronic Systems 28 (1992), pp. 383-386.
70. S. W. Golomb and G. Gong. Periodic sequences with the “trinomial property,” IEEE Trans. Inform. Theory 45 (1999), pp. 1276-1279.
71. S. W. Golomb, R. E. Peile, and R. A. Scholtz. Basic Concepts in Information Theory and Coding, New York, Plenum Press, 1994.
72. S. W. Golomb and R. A. Scholtz, Generalized Barker sequences, IEEE Trans. Inform. Theory 11 (1965), pp. 533-537.
73. S. W. Golomb, Remarks on Orthogonal Sequences, The Glenn L. Martin Company, Baltimore, MD, July 28, 1954. (Memo)
74. S. W. Golomb and H. Taylor. Constructions and properties of Costas arrays, Proc. IEEE 72 (1984), pp. 1143-1163.
75. S. W. Golomb and H. Taylor. Cyclic projective planes, perfect circular rulers, and good spanning rulers, in Sequences and Their Applications, Discrete Mathematics and Theoretical Computer Science — Proceedings ofSETA’01, V. Kumar, T. Helleseth, and K. Yang (Eds.), London, Springer-Verlag, 2002, pp. 166-181.
76. S. W. Golomb and H. Taylor. Tuscan squares — A new family of combinatorial designs, Ars Combinatoria 20-B (1985), pp. 115-132.
77. G. Gong and K. M. Khoo. Additive autocorrelation of resilient boolean functions, the Proceedings of Tenth Annual Workshop on Selected Areas in Cryptography, Lecture Notes in Computer Science, Vol. 3006, Berlin, Springer-Verlag, 2004, pp. 275-290.
78. G. Gong, New Designs for signal sets with low cross-correlation, balance property and large inear span: GF(p) Case, IEEE Trans. Inform. Theory 48 (2002), pp. 2847-2867.
79. G. Gong. Runs, component sequences and vector sequences of m-sequences over Galois fields, Acta Electronica Silica 14 (1986), pp. 94-100.
80. G. Gong. q-ary cascaded GMW sequences, IEEE Trans. Inform. Theory 42 (1996), pp. 263-267.
81. G. Gong, Sequence Analysis, Lecture Notes for Course CO739x, University of Waterloo, http://www.cacr.math.uwaterloo.ca/~ggong, Winter 1999, Chapter 5.
82. G. Gong. Theory and applications of q-ary interleaved sequences, IEEE Trans. Inform. Theory 41 (1995), pp. 400-411.
83. G. Gong, Z. D. Dai, and S. W. Golomb. Enumeration and criterion for cyclically shift- distinct q-ary GMW sequences of period qn — 1, IEEE Trans. Inform. Theory 46 (2000), pp. 474-484.
84. G. Gong, A. Di Porto, and W. Wolfowicz. Galois linear group sequences, La Comunicazione, Note Recensioni Notizie XLII (1993), pp. 83-89.
85. G. Gong, P. Gaal, and S. W. Golomb. A suspected infinite class of cyclic Hadamard difference sets, Proceedings of 1997 IEEE Information Theory Workshop, July 6-12, 1997, Longyearbyen, Svalbard, Norway.
86. G. Gong and S. W. Golomb. Binary sequences with two-level autocorrelation, IEEE Trans. Inform. Theory 45 (1999), pp. 692-693.
87. G. Gong and S. W. Golomb. The decimation-Hadamard transform of two-level autocorrelation sequences, IEEE Trans. Inform. Theory 48 (2002), pp. 853-865.
88. G. Gong and S.W. Golomb, Hadamard transforms of three term sequences, IEEE Trans. Inform. Theory 45 (1999), pp. 2059-2060.
89. G. Gong and S. W. Golomb. Personal communications, 2001.
90. G. Gong and S. W. Golomb. Transform domain analysis of DES, IEEE Trans. Inform. Theory 45 (1999), pp. 2065-2073.
91. G. Gong, T. Helleseth, and M. Ludkovski., New ternary 2-level autocorrelation sequences and realizable pairs, submitted to IEEE Trans. Inform. Theory. A preliminary version (titled as New families of ideal 2-level autocorrelation ternary sequences from second order DHT) appeared in Pre-proceedings of the second International Workshop in Coding and Cryptography, January 8-12, 2001, Paris, pp. 345-354.
92. G. Gong and H. Y. Song. Two-tuple balance of bon-binary sequences with ideal two-level autocorrelation, abstract in the Proceedings of2003 IEEE International Symposium on Information Theory (ISIT2003), June 29-July 4, Yokohama, Japan, pp. 404. Full version, Technical Report CORR 2002-20, University of Waterloo, 2002.
93. G. Gong and A. Youssef. Cryptographic properties of the Welch-Gong transformation sequence generators, IEEE Trans. Inform. Theory 48 (2002), pp. 2837-2846.
94. B. Gordon, W. H. Mill, and L. R. Welch. Some new difference sets, Canadian J. Math. (1962), pp. 614-625.
95. M. Hall, Jr. Combinatorial Theory, 2nd ed., New York, Wiley-Interscience, 1986.
96. M. Hall, Jr. A Survey of Difference Sets, Proc. Am. Math. Soc. 7 (1956), pp. 975-986.
97. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers, 5th ed., New York, Oxford University Press, 1980.
98. B. Hayes. Computing science: Collective wisdom, American Scientist 86 (1998), pp. 118-122.
99. T. Helleseth. Correlation of m-sequences and related topics, Sequences and their Applications - Proceedings of SETA’98, Discrete Mathematics and Theoretical Computer Science, Berlin, Springer-Verlag, 1999, pp. 49-66.
100. T. Helleseth. Some results about the cross-correlation functions between two maximal length linear sequences, Discrete Math. 16 (1976), pp. 209-232.
101. T. Helleseth and G. Gong. New nonbinary sequences with ideal two-level autocorrelation, IEEE Trans. Inform. Theory 48 (2002), pp. 2868-2872.
102. T. Helleseth and P. V. Kumar. Codes and sequences over Z4, in A. Pott et al. (Eds.), Difference Sets, Sequences and Their Correlation Properties (Bad Windsheim, 1998), NATO Adv. Sci. Inst. Ser. C, Math. Phys. Sci. 542 (1999).
103. T. Helleseth and P. V. Kumar. Sequences with low correlation, in Handbook of Coding Theory, V. Pless and C. Huffman (Eds.), New York, Elsevier Science, 1998, pp. 1765-1853.
104. T. Helleseth, P. V. Kumar, and H. Martinsen. A new family of ternary sequences with ideal two-level autocorrelation function, Designs, Codes and Cryptography 23 (2001), pp. 157-166.
105. T. Herlestam. On functions of linear shift register sequences, Advances in Cryptology- Eurocrypt’85, Lecture Notes in Computer Science, Vol. 219, Berlin, Springer-Verlag, 1985, pp. 119-129.
106. J. W. P. Hirschfeld. Ovals in a Desarguesian plane of even order, Ann. Mat. Pure Appl. 102 (1975), pp. 75-89.
107. J. W. P. Hirschfeld. Projective Geometries over Finite Fields, London, Oxford University Press, 2nd ed., 1998.
108. H. D. L. Hollmann and Q. Xiang. A proof of the Welch and Niho conjectures on cross correlations of binary m-sequences, Finite Fields and Their Applications 7 (2001), pp. 253-286.
109. X. D. Hou. q-ary bent functions constructed from chain rings, Finite Fields and Their Applications 4 (1998), pp. 55-61.
110. D. A. Huffman. The generation of impulse-equivalent pulse trains, IEEE Trans. Inform. Theory 8 (1962), pp. 10-16.
111. K. Ireland and M. Rosen. A Classical Introduction to Modern Number Theory, New York, Springer-Verlag, 2nd ed., 1991.
112. D. Jungnickel and A. Pott. Difference sets: an introduction, Difference sets, Sequences and Their Correlation Properties (Bad Windsheim, 1998), A. Pott et al. (Eds.), NATO Adv. Sci. Inst. Ser. C, Math. Phys. Sci. 542 (1999).
113. T. Kasami. Weight distributions of Bose-Chaudhuri-Hocquenghem codes, Combinatorial Mathematics and Its Applications, R. C. Bose and T. A. Dowling (Eds.), University of North Carolina, Chapel Hill, NC, 1969, pp. 335-357.
114. T. Kasami. The weight enumerators for several classes of subcodes of the 2nd-order Reed-Muller codes, Information and Control 18 (1971), pp. 369-394.
115. H. Kharaghani and B. Tayfeh-Rezaie. A Hadamard matrix of order 428, preprint, June 2004.
116. K. M. Khoo, G. Gong, and D. R. Stinson. A new family of Gold-like sequences, Proceedings of the 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 30-July 5, 2002, p. 81.
117. J. H. Kim and H. Y. Song. Existence of cyclic Hadamard difference sets and its relation to binary sequences with ideal autocorrelation, Journal of Communications and Networks 1 (1999), pp. 14-18.
118. A. Klapper. d-form sequences: families of sequences with low correlation values and large linear spans, IEEE Trans. Inform. Theory 41 (1995), pp. 423-431.
119. A. Klapper. Large families of sequences with near-optimal correlations and large linear span, IEEE Trans. Inform. Theory 42 (1996), pp. 1241-1248.
120. A. Klapper, A. H. Chan, and M. Goresky. Cascaded GMW sequences, IEEE Trans. Inform. Theory 39 (1993), pp. 177-183.
121. A. Klapper, A. H. Chan, and M. Goresky. Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences, Discrete Appl. Math. 46 (1993), pp. 1-20.
122. P. V. Kumar. Frequency-hopping code sequence designs having large linear span, IEEE Trans. Inform. Theory 34 (1988), pp. 146-151.
123. P. V. Kumar. On Bent sequences and generalized bentfunctions, Ph. D. Thesis, University of Southern California, Los Angeles, 1983.
124. P. V. Kumar, T. Helleseth, A. R. Calderbank, and A. R. Hammons. Large families of quaternary sequences with low correlation, IEEE Trans. Inform. Theory 42 (1996), pp. 579-592.
125. P. V. Kumar and O. Moreno. Prime-phase sequences with periodic correlation properties better than binary sequences, IEEE Trans. Inform. Theory 37 (1991), pp. 603-616.
126. R. Lidl and H. Niederreiter., Finite Fields, Encyclopedia of Mathematics and its Applications, Vol. 20, Reading, MA, Addison-Wesley, 1983. (Revised version, Cambridge University Press, 1997.)
127. A. H. Lin. From cyclic Hadamard difference sets to perfectly balanced sequences, Ph.D. thesis, University of Southern California, Los Angeles, 1998.
128. E. Lucas. Sur La récherche des grand nonbres première, Assoc. Francaispour l’Avanc. des Scièpces 5 (1876), pp. 61-68.
129. H. D. Lüke. Korrelationssignale, Springer-Verlag, Berlin, 1992.
130. I. G. MacDonald. Symmetric Functions and Hall Polynomials, Oxford, Oxford Univer sity Press, 3rd ed., 1999.
131. S. Maitra and P. Sarkar. Modifications of Patterson-Wiedemann functions for cryptographic applications, IEEE Trans. Inform. Theory 48 (2002), pp. 278-284.
132. S. Maitra and P. Sarkar. Nonlinearity bounds and constructions of resilient boolean functions, Advances in Cryptology-Crypto’2000, Lecture Notes in Computer Science, Vol. 1880, Berlin, Springer-Verlag, 2000, pp. 515-532.
133. R. W. Marsh. Table of irreducible polynomials over GF(2) through degree 19, U.S. Department of Commerce, Office of Technical Services, Washington D.C., 1957.
134. A. Maschietti. Difference sets and hyperovals, Designs, Codes and Cryptography 14 (1998), pp. 89-98.
135. J. L. Massey. Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory 15 (1969), pp. 81-92.
136. G. L. Mayhew and S. W. Golomb. Linear spans of modified de Bruijn sequences, IEEE Trans. Inform. Theory 36 (1990), pp. 1166-1167.
137. R. J. McEliece. Finite Fields for Computer Scientists and Engineers, The Kluwer International Series in Engineering and Computer Science, Vol. 23, Boston, Kluwer Academic, 1986.
138. R. L. McFarland. A family of noncyclic difference sets, Journal of Combinatorial Theory, Series A 15 (1973), pp. 1-10.
139. R. L. McFarland and B. F. Rice. Translates and multipliers of abelian difference sets, Proc. Amer. Math. Soc. 68 (1978), pp. 375-379.
140. F. J. McWilliams and N. J. A. Sloane. Theory of Error-Correcting Codes, Amsterdam, North-Holland, 1977 (revised, 1991).
141. W. Meier and O. Staffelbach. Fast correlation attacks on stream ciphers, Advances in Cryptology-Eurocrypt’88, Lecture Notes in Computer Science, 1988, Vol. 330, pp. 301-314.
142. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography, Boca Raton, LA, CRC Press, 1996.
143. O. Moreno. Survey of results on signal patterns for locating one or multiple targets, in Pott et al. (Eds.), Difference Sets, Sequences and Their Correlation Properties (Bad Windsheim, 1998), NATO Adv. Sci. Inst. Ser. C, Math. Phys. Sci. 542 (1999).
144. Y. Niho. Multi-valued cross-correlation functions between two maximal linear recursive sequences, Ph.D. Thesis, University of Southern California, Los Angeles, USCEE report 409, 1972.
145. J. S. No. Generalization of GMW sequences and No sequences, IEEE Trans. Inform. Theory 42 (1996), pp. 260-262.
146. J. S. No. p-ary unified sequences: p-ary extended d-form sequences with ideal autocorrelation property, IEEE Tran. Inform. Theory 48 (2002), pp. 2540-2546.
147. J. S. No, H. B. Chung, and M. S. Yun. Binary pseudorandom sequences of period 2m — 1 with ideal autocorrelation generated by the polynomial zd + (z + 1)d, IEEE Trans. Inform. Theory 44 (1998), pp. 1278-1282.
148. J. S. No, S.W. Golomb, G. Gong, H. K. Lee, and P. Gaal. Binary pseudorandom sequences of period 2n — 1 with ideal autocorrelation, IEEE Trans. Inform. Theory 44 (1998), pp.814-817.
149. J. S. No and P. V. Kumar. A new family of binary pseudo-random sequences having optimal periodic correlation properties and larger linear span, IEEE Trans. Inform. Theory 35 (1989), pp. 371-379.
150. J. S. No, H. K. Lee, H. B. Chung, H. Y. Song, and K. C. Yang. Trace representation of Legendre sequences of Mersenne prime period, IEEE Trans. Inform. Theory 42 (1996), pp. 2254-2255.
151. J. S. No, K. Yang, H. G. Chung, and H. Y. Song. New constructions for families of binary sequences with optimal correlation properties, IEEE Trans. Inform. Theory 43 (1997), pp. 1596-1602.
152. K. Nyberg. Perfect nonlinear S-boxes, Advances in Cryptology-Eurocrypt’91, Lecture Notes in Computer Science, Vol. 547, Berlin, Springer-Verlag, 1991, pp. 378-386.
153. J. D. Olsen, R. A. Scholtz, and L. R. Welch. Bent-function sequences, IEEE Trans. Inform. Theory 28 (1982), pp. 858-864.
154. O. Ore. Contributions to the Theory of Finite Fields, Trans. Am. Math. Soc. 36 (1934), pp. 243-274.
155. R. E. A. C. Paley. On Orthogonal Matrices, J. Math. Phys. 12 (1933), pp. 311-320.
156. W. J. Park and J. J. Komo. Relationships between m-sequences over GF(q) and GF(qm), IEEE Trans. Inform. Theory 35 (1989), pp. 183-186.
157. K. G. Paterson. Binary sequence sets with favorable correlations from difference sets and MDS codes, IEEE Trans. Inform. Theory 44 (1998), pp. 172-180.
158. N. J. Patterson and D. H. Wiedemann. Correction to the covering radius of the (215, 16) Reed-Muller code is at least 16276, IEEE Trans. Inform. Theory 36 (1990), p. 443.
159. N. J. Patterson and D. H. Wiedemann. The covering radius of the (215, 16) Reed-Muller Code is at least 16276, IEEE Trans. Inform. Theory 29 (1983), pp. 354-356.
160. O. Perron. Bemerkungen über die verteilung der quadratischen reste, Math. Zeitschrift56 (1952), pp. 122-130.
161. J. G. Proakis. Digital Communications, New York, McGraw-Hill, 3rd ed., 1995.
162. L. Rédei. Algebra, Germany, Leipzig, Geest & Portig, 1959; Oxford, New York, Pergamon Press, 1st English edition, 1967.
163. O. S. Rothaus. On “bent” functions, Journal of Combinatorial Theory, Series A 20 (1976), pp. 300-305.
164. R. A. Rueppel. Analysis and Design ofStream Ciphers, Berlin, Springer-Verlag, 1986.
165. J. Ryser. Combinatorial Mathematics, Carus Mathematical Monographs, No. 14, Math. Assoc. of America, Washington DC, 1963.
166. R. A. Scholtz and L. R. Welch. GMW sequences, IEEE Trans. Inform. Theory 30 (1984), pp. 548-553.
167. B. Segre. Ovals in a finite projective plane, Canadian J. Math. 7 (1955), pp. 414-416.
168. B. Segre and U. Bartocci. Ovali ed altre curve nei piani di Galois di caratteristica due, Acta Arith. 8 (1971), pp. 423-449.
169. I. Selin. Detection Theory, Princeton, NJ, Princeton University Press, 1965.
170. E. S. Selmer. Linear Recurrence Relations over Finite Fields, Bergan, Norway, Department of Mathematics, University of Bergen, 1966.
171. C. E. Shannon., A mathematical theory of communication, Bell System Technical Journal 27 (1948), pp. 379-423 (Part I), July (1948), pp. 623-656 (Part II), October.
172. J. B. Shearen. Some new optimum Golomb rulers, IEEE Trans. Inform. Theory 36 (1990), pp. 183-184.
173. D. A. Shedd and D. V. Sarwate. Construction of sequences with good correlation prop erties, IEEE Trans. Inform. Theory, Vol. 25, No. 1, January 1979, pp. 94-97.
174. W. O. Sibert, in a letter to H. Taylor and S. Golomb, April 1993. (This reference appeared in the paper of Dollas, Rankin and McCracken 1998.)
175. V. M. Sidelnikov. On mutual correlation of sequences, Probl. Kybern. 24 (1978), pp. 537-545.
176. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications, IEEE Trans. Inform. Theory 30 (1984), pp. 776-780.
177. J. Singer. A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc. 43 (1938), pp. 377-385.
178. H. Y. Song and S. W. Golomb. On the existence of cyclic Hadamard difference sets, IEEE Trans. Inform. Theory 40 (1994), pp. 1266-1268.
179. R. G. Stanton and D. A. Sprott. A family of difference sets, Canad. J. Math. 10 (1958), pp. 73-77.
180. H. Stichtenoth. Algebraic Function Fields and Codes, Berlin, Springer-Verlag, 1993.
181. H. M. Trachtenberg. On the cross-correlation functions of maximal linear sequences, Ph.D. Thesis, University of Southern California, Los Angeles, 1970.
182. R. J. Turyn. Character sums and difference sets, Pacific Journal of Mathematics 15 (1965), pp. 319-346.
183. R. Turyn. Sequences with small correlation, in Henry B. Mann (Ed.), Error Correcting Codes, New York, John Wiley & Sons, 1968, pp. 195-228.
184. R. J. Turyn and J. Storer. On binary sequences, Proceedings ofthe American Mathematical Society 12 (1961), pp. 394-399.
185. B. L. van der Waerden. Modern Algebra (English Translation), New York, Frederick Ungar, 1953.
186. A. J. Viterbi. CDMA — Principles of Spread Spectrum Communication, Reading, MA, Addison-Wesley, 1995.
187. M. Ward. The arithmetical theory of linear recurring series, Trans. Amer. Math. Soc. 35 (1933), pp. 600-628.
188. M. Ward. The characteristic number of a sequence of integers satisfying a linear recursion relation, Trans. Amer. Math. Soc. 33 (1931), pp. 153-165.
189. L. R. Welch. Lower bounds on the minimum correlation of signals, IEEE Trans. Inform. Theory 20 (1974), pp. 397-399.
190. J. Williamson. Hadamard's determinant theorem and the sum of four squares, Duke MathJ. 11 (1944), pp. 65-81.
191. Q. Xiang. On balanced binary sequences with two-level autocorrelation functions, IEEE Trans. Inform. Theory 44 (1998), pp. 3153-3156.
192. G. Z. Xiao and J. L. Massey. A spectral characterization of correlation-immune combining functions, IEEE Trans. Inform. Theory 34 (1988), pp. 569-571.
193. G. Yovanof and S. W. Golomb. The polynomial model in the study of counterexamples to S. Piccard's Theorem, Ars Combinatoria 48 (1998), pp. 43-63.
194. K. C. Zeng and M. X. Huang. On the linear syndrome method in cryptoanalysis, Advances in Cryptology-Crypto’88, S. Goldwasser (Ed.), Lecture Notes in Computer Science, Vol. 403, Berlin, Springer-Verlag, 1990, pp. 469-478.
195. N. Zhang and S. W. Golomb. Polyphase sequences with low autocorrelations, IEEE Trans. Inform. Theory 39 (1993), pp. 1085-1089.
196. Y. L. Zheng and X. M. Zhang. Improved upper bound on the nonlinearity of high order correlation immune functions, Proceedings of Selected Areas in Cryptography 2000, Lecture Notes in Computer Science, Vol. 2012, Berlin, Springer-Verlag, 2001, pp. 262-274.
197. Y. L. Zheng and X. M. Zhang. Relationships between bent functions and complementary plateaued functions, Information and Communications Security (ICICS’99), Lecture Notes in Computer Science, Vol. 1787, Berlin, Springer-Verlag, 1999, pp. 60-75.
198. N. Zierler. Linear recurring sequences, J. Soc. Indust. Appl. Math. 7 (1959), pp. 31-48.