Hadamard matrices and their applications

Hadamard Matrices and Their Applications

Volumn , Issue , 2012, Pages 1-263

  Horadam, K J ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84924286839     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (335)

1. S. S. Agaian, Hadamard Matrices and Their Applications, LNM 1168, Springer, Berlin, 1985.
2. N. Ahmed and K. R. Rao, Orthogonal Transforms for Digital Signal Processing, Springer, Berlin, 1975.
3. J. L. Alperin and R. B. Bell, Groups and Representations, Springer, New York, 1995.
4. V. Alvarez, J. A. Armario, M. D. Frau and P. Real, An algorithm for computing cocyclic matrices developed over some semidirect products, AAECC-14, S. Boztaş, I. Shparlinski, eds., LNCS 2227, Springer, Berlin, 2001, 287-296.
5. V. Alvarez, J. A. Armario, M. D. Frau and P. Real, A genetic algorithm for cocyclic Hadamard matrices, AAECC-16, M. Fossorier et al., eds., LNCS 3857, Springer, Berlin, 2006, 144-153.
6. V. Alvarez, J. A. Armario, M. D. Frau and P. Real, Calculating cocyclic Hadamard matrices in Mathematica: exhaustive and heuristic searches, ICMS 2006, A. Iglesias, N. Takayama, eds., LNCS 4151, Springer, Berlin 2006, 419-422.
7. F. W. Anderson and K. R. Fuller, Rings and Categories of Modules, 2nd ed., GTM 13, Springer, New York, 1992.
8. K. T. Arasu and W. de Launey, Two-dimensional perfect quaternary arrays, IEEE Trans. Inform. Theory 47 (2001) 1482-1493.
9. K. T. Arasu, W. de Launey and S.-L. Ma, On circulant complex Hadamard matrices, Des. Codes Cryptogr. 25 (2002) 123-142.
10. K. T. Arasu and J. F. Dillon, Perfect ternary arrays, Difference Sets, Sequences and Their Correlation Properties, A. Pott, P. V. Kumar, T. Helleseth and D. Jungnickel, eds., NATO Science Series C, 542, Kluwer, Dordrecht, 1999, 1-15.
11. K. T. Arasu, D. Jungnickel, S.-L. Ma and A. Pott, Relative difference sets with n = 2, Discr. Math. 147 (1995) 1-17.
12. J. P. Arpasi and R. Palazzo Jr., An algorithm to construct strongly controllable group codes from an abstract group, Proc. 1998 ISIT, IEEE (1998), 154.
13. M. Aschbacher, Finite Group Theory, 2nd ed., CUP, Cambridge, 2000.
14. E. F. Assmus Jr and J. D. Key, Designs and Their Codes, CUP, Cambridge, 1992.
15. R. Baer, Erweiterung von Gruppen und ihre Automorphismen, Math. Z. 38 (1934) 375-416.
16. A. Baliga, New self-dual codes from cocyclic Hadamard matrices, J. Combin. Math. Combin. Comput. 28 (1998) 7-14.
17. A. Baliga, Cocyclic codes of length 40, Des. Codes Cryptogr. 24 (2001) 171-179.
18. A. Baliga and K. J. Horadam, Cocyclic Hadamard matrices over Zt £ Z22, Australas. J. Combin. 11 (1995) 123-134.
19. S. Ball and M. R. Brown, The six semifield planes associated with a semifield flock, Adv. Math. 189 (2004) 68-87.
20. R. H. Barker, Group synchronisation of binary digital systems, Communication Theory (Proc. Second London SIT), Butterworth, London, 1953, 273-287.
21. P. S. L. M. Barreto, H. K. Kim, B. Lynn and M. Scott, Efficient algorithms for pairing-based cryptosystems, CRYPTO 2002, LNCS 2442, Springer, Berlin, 2002, 354-368.
22. N. Bauer, P. Carmany and K. W. Smith, All (8; 8; 8; 1) relative difference sets, draft manuscript, February 2006.
23. K. G. Beauchamp, Walsh Functions and Their Applications, Academic Press, London, 1975.
24. T. Beth, D. Jungnickel and H. Lenz, Design Theory, 2nd ed., CUP, Cambridge, 1999.
25. T. Beth, H. Kalouti and D. E. Lazic, Which families of long binary linear codes have a binomial weight distribution?, AAECC-11, G. Cohen, M. Giusti, T. Mora, eds., LNCS 948, Springer, Berlin, 1995, 120-130.
26. E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, J. Cryptology 4 (1991) 3-72.
27. I. Blake, G. Seroussi and N. Smart, Elliptic Curves in Cryptography, LMS Lecture Note Series 265, CUP, Cambridge, 1999.
28. M. Blaum, J. Bruck and A. Vardy, Interleaving schemes for multidimensional cluster errors, IEEE Trans. Inform. Theory 44 (1998) 730-743.
29. M. Blaum, P. G. Farrell and H. C. A. van Tilborg, Array codes, Chapter 22, Handbook of Coding Theory, V. S. Pless and W. C. Huffman, eds., North-Holland, Amsterdam, 1998.
30. A. Blokhuis, D. Jungnickel and B. Schmidt, Proof of the prime power conjecture for projective planes of order n with abelian collineation groups of order n2, Proc. Amer. Math. Soc. 130 (2002) 1473-1476.
31. 4, IEEE Trans. Inform. Theory 43 (1997) 1-13.
32. W. Bosma, J. Cannon and C. Playoust, The MAGMA algebra system I: the user language, J. Symbol. Comp. 24 (1997) 235-265.
33. S. Boztaş, Constacyclic codes and constacyclic DFTs, Proc. 1998 ISIT, IEEE (1998) 235.
34. S. Boztaş, R. Hammons and P. V. Kumar, 4-phase sequences with nearoptimum correlation properties, IEEE Trans. Inform. Theory 38 (1992) 1101-1113.
35. L. Breveglieri, A. Cherubini and M. Macchetti, On the generalized linear equivalence of functions over finite fields, ASIACRYPT 2004, P. J. Lee, ed., LNCS 3329, Springer, Berlin, 2004, 79-91.
36. K. Brincat, F. C. Piper and P. R.Wild, Stream ciphers and correlation, Difference Sets, Sequences and Their Correlation Properties, A. Pott et al., eds., NATO Science Series C, 542, Kluwer, Dordrecht, 1999, 17-44.
37. B. W. Brock, Hermitian congruence and the existence and completion of generalised Hadamard matrices, J. Combin. Theory A 49 (1988) 233-261.
38. K. S. Brown, Cohomology of Groups, GTM 87, Springer, New York, 1982.
39. L. Budaghyan, C. Carlet and A. Pott, New classes of almost bent and almost perfect nonlinear polynomials, IEEE Trans. Inform. Theory 52 (2006) 1141-1152.
40. A. T. Butson, Generalised Hadamard matrices, Proc. Amer. Math. Soc. 13 (1962) 894-898.
41. D. Calabro and J. K.Wolf, On the synthesis of two-dimensional arrays with desirable correlation properties, Inform. Control 11 (1968) 537-560.
42. A. Canteaut, Cryptographic functions and design criteria for block ciphers, INDOCRYPT 2001, C. Pandu Rangan and C. Ding, eds., LNCS 2247, Springer, Berlin, 2001, 1-16.
43. A. Canteaut, P. Charpin and H. Dobbertin, Binary m-sequences with threevalues crosscorrelation: a proof of Welch's conjecture, IEEE Trans. Inform. Theory 46 (2000) 4-8.
44. A. Canteaut and M. Videau, Degree of composition of highly nonlinear functions and applications to higher order differential cryptanalysis, EUROCRYPT-02, LNCS 2332, Springer, Berlin, 2002, 518-533.
45. 2k -linear codes, IEEE Trans. Inform. Theory 44 (1998) 1543-1547.
46. C. Carlet, Boolean functions for cryptography and error-correcting codes; and, Vectorial Boolean functions for cryptography, Boolean Methods and Models, P. Hammer and Y. Crama, eds., CUP, Cambridge, 2006, to appear.
47. C. Carlet, P. Charpin and V. Zinoviev, Codes, bent functions and permutations suitable for DES-like cryptosystems, Des. Codes Cryptogr. 15 (1998) 125-156.
48. C. Carlet and C. Ding, Highly nonlinear mappings, J. Complexity 20 (2004) 205-244.
49. F. Chabaud and S. Vaudenay, Links between linear and differential cryptanalysis, EUROCRYPT-94, LNCS 950, Springer, New York, 1995, 356-365.
50. W. K. Chan and M. K. Siu, Summary of perfect s × t arrays, 1 ≤ s ≤ t ≤ 100, Electron. Lett. 27 (1991) 709-710, Errata, same volume 1112.
51. W. K. Chan, M. K. Siu and P. Tong, Two-dimensional binary arrays with good autocorrelation, Inform. Control 42 (1979) 125-130.
52. C. Charnes, M. Rötteler and T. Beth, Homogeneous bent functions, invariants, and designs, Des. Codes Cryptogr. 26 (2002) 139-154.
53. Y. Q. Chen, On the existence of abelian Hadamard difference sets and a new family of difference sets, Finite Fields Appl. 3 (1997) 234-256.
54. Y. Q. Chen, K. J. Horadam and W. H. Liu, Relative difference sets fixed by inversion (III)-Cocycle theoretical approach, Discr. Math. (2007), to appear.
55. W. Chu and C. J. Colbourn, Optimal (n; 4; 2)-OOC of small orders, Discr. Math. 279 (2004) 163-172.
56. J. J. Chua and A. Rao, An image-guided heuristic for planning an exhaustive enumeration, Proc. 2004 HIS, IEEE (2005) 136-141; and personal communication May 2005.
57. C. J. Colbourn and W. de Launey, Difference matrices, Chapter IV.11, The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, 1996.
58. C. J. Colbourn and J. H. Dinitz, eds., The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, 1996.
59. M. Cordero and G. P. Wene, A survey of finite semifields, Discr. Math. 208 (1999) 125-137.
60. R. S. Coulter and M. Henderson, A class of functions and their application in constructing semi-biplanes and association schemes, Discr. Math. 202 (1999) 21-31.
61. R. S. Coulter and M. Henderson, Commutative presemifields and semifields, preprint 2004.
62. R. S. Coulter and M. Henderson, A new class of commutative presemifields of odd order, preprint 2005.
63. R. S. Coulter and R. W. Matthews, Planar functions and planes of Lenz-Barlotti Class II, Des. Codes Cryptogr. 10 (1997) 167-184.
64. R. Craigen, Complex Golay sequences, J. Combin. Math. Combin. Comput. 15 (1994) 161-169.
65. R. Craigen, Hadamard matrices and designs, Chapter IV.24, The CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, eds., CRC Press, Boca Raton, 1996.
66. R. Craigen, Signed groups, sequences, and the asymptotic existence of Hadamard matrices, J. Combin. Theory A 71 (1995) 241-254.
67. R. Craigen and H. Kharaghani, Hadamard matrices from weighing matrices via signed groups, Des. Codes Cryptogr. 12 (1997) 49-58.
68. R. Craigen and H. Kharaghani, Hadamard matrices and designs, Part V.1, The CRC Handbook of Combinatorial Designs, 2nd ed., C. J. Colbourn and J. H. Dinitz, eds., CRC Press, Boca Raton, 2006.
69. R. Craigen and W. D. Wallis, Hadamard matrices: 1893-1993, Congr. Numer. 97 (1993) 99-129.
70. R. Craigen and R. Woodford, Power Hadamard matrices, Discr. Math. (2007), to appear.
71. C. W. Curtis and I. Reiner, Representation Theory of Finite Groups and Associative Algebras, Wiley-Interscience, New York, 1962.
72. J. Daemen, L. R. Knudsen and V. Rijmen, The block cipher Square, Fast Software Encryption '97, E. Biham, ed., LNCS 1267, Springer, Berlin, 1997, 149-165.
73. J. Daemen and V. Rijmen, The Design of Rijndael: AES-The Advanced Encryption Standard, Springer, Berlin, 2002.
74. J. A. Davis and J. Jedwab, A survey of Hadamard difference sets, Groups, Difference Sets and the Monster, K. T. Arasu et al., eds., de Gruyter, Berlin, 1996, 145-156.
75. J. A. Davis and J. Jedwab, A unifying construction for difference sets, J. Combin. Theory A 80 (1997) 13-78.
76. W. de Launey, (0;G)-Designs with applications, Ph.D. Thesis, University of Sydney, Sydney, Australia, 1987.
77. W. de Launey, A survey of generalised Hadamard matrices and difference matrices D(k; λ;G) with large k, Utilitas Math. 30 (1986) 5-29.
78. W. de Launey, Square GBRDs over non-abelian groups, Ars Combin. 27 (1989) 40-49.
79. W. de Launey, On the construction of n-dimensional designs from 2- dimensional designs, Australas. J. Combin. 1 (1990) 67-81.
80. W. de Launey, A note on N-dimensional Hadamard matrices of order 2t and Reed-Muller codes, IEEE Trans. Inform. Theory 37 (1991) 664-667.
81. W. de Launey, Generalised Hadamard matrices which are developed modulo a group, Discr. Math. 104 (1992) 49-65.
82. W. de Launey, Cocyclic Hadamard matrices and relative difference sets, Hadamard Centenary Conference, U. Wollongong, Wollongong, Australia, December 1993, unpublished.
83. W. de Launey, On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects, Discr. Appl. Math. 102 (2000) 37-45.
84. W. de Launey, On a family of cocyclic Hadamard matrices, Ohio State Univ. Math. Res. Inst. Publ. 10, de Gruyter, Berlin, 2002, 187-205.
85. W. de Launey, personal communication, March 2005.
86. W. de Launey, Generalised Hadamard matrices, Part V.5, The CRC Handbook of Combinatorial Designs, 2nd ed., C. J. Colbourn and J. H. Dinitz, eds., CRC Press, Boca Raton, 2006.
87. W. de Launey and D. L. Flannery, Cocyclic Development of Combinatorial Designs, manuscript in preparation, 2006.
88. W. de Launey, D. L. Flannery and K. J. Horadam, Cocyclic Hadamard matrices and difference sets, Discr. Appl. Math. 102 (2000) 47-61.
89. W. de Launey and D. M. Gordon, A comment on the Hadamard conjecture, J. Combin. Theory A 95 (2001) 180-184.
90. W. de Launey and K. J. Horadam, A weak difference set construction for higher dimensional designs, Des. Codes Cryptogr. 3 (1993) 75-87.
91. W. de Launey and M. J. Smith, Cocyclic orthogonal designs and the asymptotic existence of cocyclic Hadamard matrices and maximal size relative difference sets with forbidden subgroup of size 2, J. Combin. Theory A 93 (2001) 37-92.
92. W. de Launey and R. M. Stafford, On cocyclic weighing matrices and the regular group actions of certain Paley matrices, Discr. Appl. Math. 102 (2000) 63-101.
93. W. de Launey and R. M. Stafford, On the automorphisms of Paley's Type II Hadamard matrix, Discr. Math. (2007), to appear.
94. 2, Math. Z. 103 (1968) 239-258.
95. C. Ding and J. Yuan, A family of skew Hadamard difference sets, J. Combin. Theory A 113 (2006) 1526-1535.
96. J. H. Dinitz and D. R. Stinson, eds., Contemporary Design Theory: A Collection of Surveys, Wiley, New York, 1992.
97. D. Z. Djoković, Williamson matrices of orders 4.29 and 4.31, J. Combin. Theory A 59 (1992) 309-311.
98. D. Z. Djoković, Williamson matrices of orders 4n for n = 33, 35, 39, Discr. Math. 115 (1993) 267-271.
99. D. Z. Djoković, Two Hadamard matrices of order 956 of Goethals-Seidel type, Combinatorica 14 (1994) 375-377.
100. H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity, Fast Software Encryption: Second International Workshop, B. Preneel, ed., LNCS 1008, Springer, Berlin, 1995, 61-74.
101. n): the Welch case, IEEE Trans. Inform. Theory 45 (1999) 1271-1275.
102. D. A. Drake, Partial λ-geometries and generalised Hadamard matrices, Canad. J. Math. 31 (1979) 617-627.
103. R. Dutta, R. Barua and P. Sarkar, Pairing-based cryptographic protocols: A survey, Cryptology ePrint Archive, Report 2004/064, http://eprint.iacr.org/, last revised 24 June 2004.
104. I. Duursma, T. Helleseth, C. Rong and K. Yang, Split weight enumerators for the Preparata codes with applications to designs, Des. Codes Cryptogr. 18 (1999) 103-124.
105. D. F. Elliott and K. R. Rao, Fast Transforms: Algorithms, Analyses, Applications, Academic Press, New York, 1982.
106. J. E. H. Elliott and A. T. Butson, Relative difference sets, Illinois J. Math. 10 (1966) 517-531.
107. G. Ellis and I. Kholodna, Computing second cohomology of finite groups with trivial coefficients, Homology, Homotopy Appl. 1 (1999) 163-168 (electronic).
108. q5, D. Jungnickel and H. Niederreiter, eds., Springer, Berlin, 2001, 122-127.
109. P. G. Farrell, Recent developments in array error-control codes, Ninth IMA Int. Conf. Crypto. and Coding, Cirencester UK, 16-18 Dec. 2003, typescript of plenary talk. Abstract, LNCS 2898, Springer, Berlin, 2003, 1-3.
110. D. L. Flannery, Transgression and the calculation of cocyclic matrices, Australas. J. Combin. 11 (1995) 67-78.
111. D. L. Flannery, Calculation of cocyclic matrices, J. Pure Appl. Algebra 112 (1996) 181-190.
112. D. L. Flannery, Cocyclic Hadamard matrices and Hadamard groups are equivalent, J. Algebra 192 (1997) 749-779.
113. D. L. Flannery, personal communication, October 2004.
114. D. L. Flannery and E. A. O'Brien, Computing 2-cocycles for central extensions and relative difference sets, Comm. Algebra 28 (2000) 1939-1955.
115. R. Forré, The strict avalanche criterion: spectral properties of Boolean functions and an extended definition, CRYPTO '88, LNCS 403, Springer, Berlin, 1990, 450-468.
116. M. D. Frau, Cocyclic development of designs and applications, Ph.D. Thesis (English version), University of Sevilla, Seville, Spain, 2003. Corrigenda: personal communication, March 2006.
117. s, IEEE Trans. Inform. Theory 51 (2005) 1163-1166.
118. J. C. Galati, A group extensions approach to relative difference sets, Ph.D. Thesis, RMIT University, Melbourne, Australia, 2003.
119. J. C. Galati, Application of Gaschütz' Theorem to relative difference sets in non-abelian groups, J. Combin. Designs 11 (2003) 307-311.
120. J. C. Galati, A group extensions approach to relative difference sets, J. Combin. Designs 12 (2004) 279-298.
121. J. C. Galati, On the non-existence of semiregular relative difference sets in groups with all Sylow subgroups cyclic, Des. Codes Cryptogr. 36 (2005) 29-31.
122. M. J. Ganley, On a paper of Dembowski and Ostrom, Arch. Math. 26 (1976) 93-98.
123. A. V. Geramita and J. Seberry, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York, 1979.
124. J.-M. Goethals and J. J. Seidel, Orthogonal matrices with zero diagonal, Canad. J. Math. 19 (1967) 1001-1010.
125. J.-M. Goethals and J. J. Seidel, A skew Hadamard matrix of order 36, J. Austral. Math. Soc. 11 (1970) 343-344.
126. S. W. Golomb, Shift Register Sequences, Holden-Day, San Francisco, 1967. Reprinted by Aegean Park Press, 1982.
127. S.W. Golomb, Construction of signals with favorable correlation properties, Difference Sets, Sequences and Their Correlation Properties, A. Pott et al., eds., NATO Science Series C, 542, Kluwer, Dordrecht, 1999.
128. H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini and R. Padma, Cryptography, connections, cocycles and crystals: a p-adic exploration of the Discrete Logarithm Problem, INDOCRYPT 2004, A. Canteaut and K. Viswanathan, eds., LNCS 3348, Springer, Berlin, 2004, 305-314.
129. X. Gourdon, The 1013 first zeros of the Riemann Zeta function, and zeros computation at very large height, preprint October 2004. Available from http://numbers.computation.free.fr/Constants/constants.html. See also New Scientist, 27 November 2004, 11.
130. J. Grabmeier and L. A. Lambe, Computing resolutions over finite p-groups, Proc. ALCOMA-99, A. Betten et al., eds., Springer, Berlin, 2001, 157-195.
131. T. A. Gulliver, New quaternary linear codes of dimension 5, Proc. 1995 ISITA, IEEE (1995) 493.
132. s, Ph.D. Thesis, IIT, Kanpur, India, 1999.
133. J. Hadamard, Résolution d'une question relative aux déterminants, Bull. Sciences Math. (2), 17 (1893) 240-246.
134. M. Hall Jr., The Theory of Groups, 2nd ed., AMS Chelsea, Providence RI, 1976.
135. R. M. Hammaker et al., Hadamard Transform Raman spectrometry, Chapter 5, Modern Techniques in Raman Spectroscopy, J. J. Laserna, ed., Wiley, Chichester, 1996.
136. J. Hammer and J. Seberry, Higher dimensional orthogonal designs and Hadamard matrices II, Congr. Numer. 27 (1979) 23-29.
137. J. Hammer and J. Seberry, Higher dimensional orthogonal designs and Hadamard matrices, Congr. Numer. 31 (1981) 95-108.
138. J. Hammer and J. Seberry, Higher dimensional orthogonal designs and applications, IEEE Trans. Inform. Theory 27 (1981) 772-779.
139. 4-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inform. Theory 40 (1994) 301-319.
140. M. Harada and V. D. Tonchev, Singly-even self-dual codes and Hadamard matrices, AAECC-11, G. Cohen, M. Giusti and T. Mora, eds., LNCS 948, Springer, Berlin, 1995, 279-284.
141. H. F. Harmuth, Transmission of Information by Orthogonal Functions, 2nd ed., Springer, Berlin, 1972.
142. M. Harwit and N. J. A. Sloane, Hadamard Transform Optics, Academic Press, New York, 1979.
143. P. Hawkes and L. O'Connor, XOR and non-XOR differential probabilities, EUROCRYPT-99, LNCS 1592, Springer, Berlin, 1999, 272-285.
144. A. S. Hedayat, N. J. A. Sloane and J. Stufken, Orthogonal Arrays, Theory and Applications, Springer, New York, 1999.
145. A. S. Hedayat and W. D. Wallis, Hadamard matrices and their applications, Ann. Statist. 6 (1978) 1184-1238.
146. T. Helleseth, C. Rong and D. Sandberg, New families of almost perfect nonlinear power mappings, IEEE Trans. Inform. Theory 45 (1999) 475-485.
147. T. Helleseth and D. Sandberg, Some power mappings with low differential uniformity, Applic. Algebra Eng. Commun. Comp. 8 (1997) 363-370.
148. T. Helleseth and P. V. Kumar, Sequences with low correlation, Chapter 21, Handbook of Coding Theory, V. S. Pless and W. C. Huffman, eds., North-Holland, Amsterdam, 1998.
149. D. F. Holt, The calculation of the Schur multiplier of a permutation group, Computational Group Theory (Durham 1982), Academic Press, London, 1984, 307-318.
150. W. H. Holzmann and H. Kharaghani, A computer search for complex Golay sequences, Australas. J. Combin. 10 (1994) 251-258.
151. A. F. Horadam, A Guide to Undergraduate Projective Geometry, Pergamon, Sydney, 1970.
152. K. J. Horadam, Progress in cocyclic matrices, Congr. Numer. 118 (1996) 161-171.
153. K. J. Horadam, Cocyclic Hadamard codes, Proc. 1998 ISIT, IEEE (1998) 246.
154. K. J. Horadam, Sequences from cocycles, AAECC-13, M. Fossorier, H. Imai, S. Lin and A. Poli, eds., LNCS 1719, Springer, Berlin, 1999, 121-130.
155. K. J. Horadam, An introduction to cocyclic generalised Hadamard matrices, Discr. Appl. Math. 102 (2000) 115-131.
156. K. J. Horadam, Equivalence classes of central semiregular relative difference sets, J. Combin. Des. 8 (2000) 330-346.
157. K. J. Horadam, Differentially 2-uniform cocycles-the binary case, AAECC-15, M. Fossorier, T. Hoeholdt and A. Poli, eds., LNCS 2643, Springer, Berlin, 2003, 150-157.
158. K. J. Horadam, Differential uniformity for arrays, Cryptography and Coding, Proc. 9th IMA International Conference, LNCS 2898, Springer, Berlin, 2003, 115-124.
159. K. J. Horadam, The shift action on 2-cocycles, J. Pure Appl. Algebra 188 (2004) 127-143.
160. K. J. Horadam, A generalised Hadamard Transform, Proc. 2005 ISIT, IEEE (2005) 1006-1008.
161. K. J. Horadam, A theory of highly nonlinear functions, AAECC-16, M. Fossorier et al., eds., LNCS 3857, Springer, Berlin, 2006, 87-100.
162. K. J. Horadam and W. de Launey, Cocyclic development of designs, J. Alg. Combin. 2 (1993) 267-290, Erratum 3 (1994) 129.
163. K. J. Horadam and W. de Launey, Generation of cocyclic Hadamard matrices, Chap. 20, Computational Algebra and Number Theory, W. Bosma and A. van der Poorten, eds., Kluwer Academic, Dordrecht, 1995, 279-290.
164. K. J. Horadam and C. Lin, Construction of proper higher dimensional Hadamard matrices from perfect binary arrays, J. Combin. Math. Combin. Comp. 28 (1998) 237-248.
165. K. J. Horadam and A. A. I. Perera, Codes from cocycles, AAECC-12, T. Mora and H. Mattson, eds., LNCS 1255, Springer, Berlin, 1997, 151-163.
166. K. J. Horadam and A. Rao, Fourier Transforms from a weighted trace map, Proc. 2006 ISIT, IEEE (2006) 1080-1084.
167. K. J. Horadam and P. Udaya, Cocyclic Hadamard codes, IEEE Trans. Inform. Theory 46 (2000) 1545-1550.
168. a; 1)-difference sets, Des. Codes Cryptogr. 27 (2002) 281-295.
169. K. J. Horadam and P. Udaya, A new class of ternary cocyclic Hadamard codes, Applic. Algebra Eng. Commun. Comp. 14 (2003) 65-73.
170. J. Horton, C. Koukouvinos and J. Seberry, A search for Hadamard matrices constructed from Williamson matrices, Bull. ICA 35 (2002) 75-88.
171. J. F. Huang, C. C. Yang and S. P. Tseng, Complementary Walsh-Hadamard coded optical CDMA coder/decoders structured over arrayed-waveguide grating routers, Opt. Commun. 229 (2004) 241-248.
172. D. R. Hughes and F. C. Piper, Projective Planes, GTM 6, Springer, New York, 1973.
173. G. Hughes, Characteristic functions of relative difference sets, correlated sequences and Hadamard matrices, AAECC-13, M. Fossorier et al., eds., LNCS 1719, Springer, Berlin, 1999, 346-354.
174. G. Hughes, Non-splitting abelian (4t; 2; 4t; 2t) relative difference sets and Hadamard cocycles, European J. Combin. 21 (2000) 323-331.
175. G. Hughes, The equivalence of certain auto-correlated quaternary and binary arrays, Australas. J. Combin. 22 (2000) 37-40.
176. G. Hughes, Constacyclic codes, cocycles and a u + vju ¡ v construction, IEEE Trans. Inform. Theory 46 (2000) 674-680.
177. G. Hughes, Structure theorems for group ring codes with an application to self-dual codes, Des. Codes Cryptogr. 24 (2001) 5-14.
178. N. Ito, Note on Hadamard matrices of type Q, Studia Sci. Math. Hungar. 16 (1981) 389-393.
179. N. Ito, Note on Hadamard groups of quadratic residue type, Hokkaido Math. J. 22 (1993) 373-378.
180. N. Ito, On Hadamard groups, J. Algebra 168 (1994) 981-987.
181. N. Ito, On Hadamard groups II, J. Algebra 169 (1994) 936-942.
182. N. Ito, Some results on Hadamard groups, Groups-Korea '94, de Gruyter, Berlin and New York, 1995.
183. N. Ito, Remarks on Hadamard groups, Kyushu J. Math. 50 (1996) 83-91.
184. N. Ito, On Hadamard groups III, Kyushu J. Math. 51 (1997) 1-11.
185. G. James and M. Liebeck, Representations and Characters of Groups, CUP, Cambridge, 1993.
186. J. Jedwab, Generalised perfect binary arrays and Menon difference sets, Des. Codes Cryptogr. 2 (1992) 19-68.
187. J. Jedwab, C. Mitchell, F. Piper and P. Wild, Perfect binary arrays and difference sets, Discr. Math. 125 (1994) 241-254.
188. D. Jungnickel, On difference matrices, resolvable transverse designs and generalised Hadamard matrices, Math. Z. 167 (1979) 49-60.
189. D. Jungnickel, On automorphism groups of divisible designs, Can. J. Math. 34 (1982) 257-297.
190. D. Jungnickel, Difference sets, Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson, eds., Wiley, New York, 1992.
191. D. Jungnickel and A. Pott, Difference sets: Abelian, The CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, eds., CRC Press, Boca Raton, 1996.
192. D. Jungnickel and A. Pott, Difference sets: an introduction, Difference Sets, Sequences and Their Correlation Properties, A. Pott et al., eds., NATO Science Series C, 542, Kluwer, Dordrecht, 1999, 259-295.
193. D. Jungnickel and A. Pott, Perfect and almost perfect sequences, Discr. Appl. Math. 95 (1999) 331-359.
194. D. Jungnickel and B. Schmidt, Difference sets: an update, Geometry, Combinatorial Designs and Related Structures, CUP, Cambridge, 1997, 89-112.
195. D. Jungnickel and B. Schmidt, Difference sets: a second update, Rend. Circ. Mat. Palermo (2) Suppl. 53 (1998) 89-118.
196. W. M. Kantor, Automorphism groups of Hadamard matrices, J. Combin. Theory A 6 (1969) 279-281.
197. W. M. Kantor, Commutative semifields and symplectic spreads, J. Algebra 270 (2003) 96-114.
198. G. Karpilovsky, Projective Representations of Finite Groups, Marcel Dekker, New York, 1985.
199. T. Kasami, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2, IEEE Trans. Inform. Theory 20 (1974) 679.
200. A. Kerber, Applied Finite Group Actions, 2nd ed., Springer, Berlin, 1999.
201. H. Kharaghani and J. Seberry, The excess of complex Hadamard matrices, Graphs Combin. 9 (1993) 47-56.
202. H. Kharaghani and B. Tayfeh-Rezaie, A Hadamard matrix of order 428, J. Combin. Des. 13 (2005) 435-440.
203. H. Kimura and T. Niwasaki, Some properties of Hadamard matrices coming from dihedral groups, Graphs Combin. 18 (2002) 319-327.
204. T. Kiran and B. Sundar Rajan, Consta-abelian codes over Galois rings, IEEE Trans. Inform. Theory 50 (2004) 367-380.
205. T. Kiran and B. Sundar Rajan, Vandermonde-cocyclic codes and a suitable DFT, Proc. 2004 ISIT, IEEE (2004) 257.
206. D. E. Knuth, Finite semifields and projective planes, J. Algebra 2 (1965) 182-217.
207. L. E. Kopilovich, On perfect binary arrays, Electron. Lett. 24 (1988) 566-567.
208. L. E. Kopilovich, Applications of difference sets to the aperture design in multielement systems in radio science and astronomy, Difference Sets, Sequences and their Correlation Properties, A. Pott et al., eds., NATO Science Series C, 542, Kluwer, Dordrecht, 1999, 297-330.
209. L. E. Kopilovich and L. G. Sodin, Synthesis of coded masks for gamma-ray and X-ray telescopes, Mon. Not. R. Astron. Soc. 266 (1994) 357-359.
210. I. S. Kotsireas, C. Koukouvinos and J. Seberry, Hadamard ideals and Hadamard matrices with two circulant cores, European J. Combin. 27 (2006) 658-668.
211. C. Koukouvinos, personal communication, November 2005.
212. C. Koukouvinos, website http://www.math.ntua.gr/people/ckoukouv/.
213. P. V. Kumar, On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function, IEEE Trans. Inform. Theory 34 (1988) 271-277.
214. E. Kupče and R. Freeman, Fast multi-dimensional NMR of proteins, J. Biomolecular NMR 25 (2003) 349-354.
215. C. Lam, S. Lam and V. D. Tonchev, Bounds on the number of affine, symmetric and Hadamard designs and matrices, J. Combin. Theory A 92 (2000) 186-196.
216. C. Lam, S. Lam and V. D. Tonchev, Bounds on the number of Hadamard designs of even order, J. Combin. Des. 9 (2001) 363-378.
217. A. LeBel, Shift actions on 2-cocycles, Ph.D. Thesis, RMIT University, Melbourne, Australia, 2005.
218. A. LeBel and K. J. Horadam, Direct sums of balanced functions, perfect nonlinear functions and orthogonal cocycles, preprint 2006.
219. M. H. Lee, The complex reverse jacket transform, Proc. 22nd Int. Symp. on Inf. Theory and its Applications (SITA 99) Yuzawa, Niigata, Japan, Nov 30-Dec 3 1999, 423-426.
220. M. H. Lee, A new reverse jacket transform and its fast algorithm, IEEE Trans. Circuits Syst. II 47(1) (2000) 39-47.
221. M. H. Lee, B. Sunder Rajan and J. Y. Park, A generalized reverse jacket transform, IEEE Trans. Circuits Syst. II 48(7) (2001) 684-690.
222. n, J. Algebra 224 (2000) 427-436.
223. R. Lidl and H. Niederreiter, Finite Fields, Vol. 20, Encyclopedia of Mathematics and its Applications, 2nd ed., CUP, Cambridge, 1997.
224. C. Lin and W. D.Wallis, Barker sequences and circulant Hadamard matrices, J. Combin. Inform. Sys. Sci. 18 (1993) 19-25.
225. C. Lin, W. D. Wallis and L. Zhu, Generalised 4-profiles of Hadamard matrices, J. Combin. Inform. Sys. Sci. 18 (1993) 397-400.
226. S. Litsyn, An updated table of the best binary codes known, Chapter 5, Handbook of Coding Theory, V. S. Pless and W. C. Huffman, eds., North-Holland, Amsterdam, 1998.
227. W-H. Liu, Y-Q. Chen and K. J. Horadam, Relative difference sets fixed by inversion. II. Character theoretical approach, J. Combin. Theory A 111 (2005) 175-189.
228. O. A. Logachev, A. A. Salnikov and V. V. Yashchenko, Bent functions on a finite abelian group, Discrete Math. Appl. 7 (1997) 547-564.
229. K. Ma, Equivalence classes of n-dimensional proper Hadamard matrices, Australas. J. Combin. 25 (2002) 3-17.
230. K. Ma, Properties of higher dimensional proper Hadamard matrices, M. App. Sc. Thesis, RMIT University, Melbourne, Australia, 2003.
231. S.-L. Ma, Planar functions, relative difference sets, and character theory, J. Algebra 185 (1996) 342-356.
232. S.-L. Ma and A. Pott, Relative difference sets, planar functions and generalised Hadamard matrices, J. Algebra 175 (1995) 505-525.
233. I. D. MacDonald, Some p-groups of Frobenius and extra-special type, Israel J. Math. 40 (1981) 350-364.
234. C. Mackenzie and J. Seberry, Maximal q-ary codes and Plotkin's bound, Ars Combin. 26B (1988) 37-50.
235. G.W. Mackey, Induced Representations of Groups and Quantum Mechanics, W. A. Benjamin and Editore Boringhieri, New York, 1968.
236. S. Mac Lane, Homology, Springer, Berlin, 1975.
237. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, ninth impression, 1996.
238. MAGMA computational algebra software system website, http://magma.maths.usyd.edu.au/magma/.
239. D. K. Maslen and D. N. Rockmore, Generalized FFTs-a survey of some recent results, Groups and computation, II (New Brunswick, NJ, 1995), DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 28, Amer. Math. Soc., Providence, RI, 1997, 183-237.
240. S. Matsufuji and N. Suehiro, Factorisation of bent function type complex Hadamard matrices, Proc. 1996 ISSSTA, IEEE (1996) 950-954.
241. M. Matsui, Linear cryptanalysis method for DES cipher, EUROCRYPT-93, LNCS 765, Springer, Berlin, 1994, 386-397.
242. B. R. McDonald, Finite Rings with Identity, Marcel Dekker, New York, 1974.
243. R. L. McFarland, Difference sets in abelian groups of order 4p2, Mitt. Math. Sem. Giessen 192 (1989) 1-70.
244. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, 1997.
245. M. Miyamoto, A construction for Hadamard matrices, J. Combin. Theory A 57 (1991) 86-108.
246. D. C. Montgomery, Design and Analysis of Experiments, 4th ed., Wiley, New York, 1997.
247. P. Morandi, Field and Galois Theory, GTM 167, Springer, New York, 1996.
248. W. H. Mow, A new unified construction of perfect root-of-unity sequences, Proc. 1996 ISSSTA, IEEE (1996) 955-959.
249. A. A. Nechaev, Kerdock code in a cyclic form, Diskretnaya Mat. (USSR) 1 (1989) 123-139 (in Russian). English translation: Discrete Math. Appl. 1 (1991) 365-384.
250. J-S. No and H-Y.Song, Expanding generalized Hadamard matrices over Gm by substituting several generalised Hadamard matrices over G, J. Comm. and Networks 3 (4) (2001) 361-364.
251. K. Nyberg, Perfect nonlinear S-boxes, EUROCRYPT-91, LNCS 547, Springer, New York, 1991, 378-385.
252. K. Nyberg, Differentially uniform mappings for cryptography, EUROCRYPT-93, LNCS 765, Springer, New York, 1994, 55-64.
253. A. V. Oppenheim and R. W. Schafer, Digital Signal Processing, Prentice-Hall, Englewood Cliffs, 1975.
254. W. Orrick, Switching operations for Hadamard matrices, http://www.arxiv.org/abs/math.CO/0507515.
255. W. Orrick website, http://mypage.iu.edu/worrick/.
256. R. E. A. C. Paley, On orthogonal matrices, J. Math. Phys. 12 (1933) 311-320.
257. I.B.S. Passi, Group rings and their augmentation ideals, LNM 715, Springer, Berlin, 1979.
258. D.S. Passman, The Algebraic Structure of Group Rings, Wiley-Interscience, New York, 1977.
259. A. A. I. Perera, Orthogonal cocycles, Ph.D. Thesis, RMIT University, Melbourne, Australia, 1999.
260. A. A. I. Perera and K. J. Horadam, Cocyclic generalised Hadamard matrices and central relative difference sets, Des., Codes Cryptogr. 15 (1998) 187-200.
261. M. Petrescu, Existence of continuous families of complex Hadamard matrices of certain prime dimensions, Ph.D. Thesis, UCLA, USA, 1997.
262. s, IEEE Trans. Inform. Theory 50 (2004) 2165-2169.
263. V. S. Pless and W. C. Huffman, eds., Handbook of Coding Theory, North-Holland, Amsterdam, 1998.
264. L. Poinsot and S. Harari, Generalized Boolean bent functions, INDOCRYPT 2004, A. Canteaut and K. Viswanathan, eds., LNCS 3348, Springer, Berlin, 2004, 107-119.
265. A. Pott, On the structure of abelian groups admitting divisible difference sets, J. Combin. Theory A 65 (1994) 202-213.
266. A. Pott, Finite Geometry and Character Theory, LNM 1601, Springer, Berlin, 1995.
267. A. Pott, A survey on relative difference sets, Groups, Difference Sets and the Monster, de Gruyter, New York, 1996, 195-232.
268. A. Pott, Nonlinear functions in abelian groups and relative difference sets, Discr. Appl. Math. 138 (2004) 177-193.
269. A. Pott, P. V. Kumar, T. Helleseth and D. Jungnickel, eds., Difference Sets, Sequences and their Correlation Properties, NATO Science Series C, 542, Kluwer, Dordrecht, 1999.
270. B. Preneel et al., Propagation characteristics of Boolean functions, EUROCRYPT '90, LNCS 473, Springer, Berlin, 1991, 161-173.
271. C. Qu, J. Seberry and J. Pieprzyk, Homogeneous bent functions, Discr. Appl. Math. 102 (2000) 133-139.
272. S. Rahardja and B. J. Falkowski, Classifications and graph-based representations of switching functions using a novel complex spectral technique, Int. J. Electron. 86 (1997) 731-742.
273. S. Rahardja and B. J. Falkowski, Family of unified complex Hadamard Transforms, IEEE Trans. Circuits Syst. II 46 (1999) 1094-1100.
274. A. Rao, Shift-equivalence and cocyclic self-dual codes, J. Combin. Math. Combin. Comput. 54 (2005) 175-185.
275. N. A. Riza and M. A. Arain, Code-multiplexed optical scanner, Applied Optics 8 (2003) 1493-1502.
276. D. J. S. Robinson, A Course in the Theory of Groups, 2nd ed., Springer, New York, 1996.
277. R. M. Roth, Maximum-rank array codes and their application to crisscross error correction, IEEE Trans. Inform. Theory 37 (1991) 328-336.
278. O. S. Rothaus, On "bent" functions, J. Combin. Theory A 20 (1976) 300-305.
279. R. E. Sabin, On determining all codes in semi-simple group rings, AAECC-10, LNCS 673, Springer, Berlin, 1993, 279-290.
280. B. Schmidt, Williamson matrices and a conjecture of Ito's, Des. Codes Cryptogr. 17 (1999) 61-68.
281. B. Schmidt, Cyclotomic integers and finite geometry, J. Amer. Math. Soc. 12 (1999) 929-952.
282. O. Schreier, Über Erweiterungen von Gruppen I, Monatsh. Math. Phys. 34 (1926) 165-180.
283. O. Schreier, Über Erweiterungen von Gruppen II, Abh. Math. Sem. Hamburg Univ. 4 (1926) 321-346.
284. I. Schur, Über die Darstellung der endlichen Gruppen durch gebrochene lineare Substiutionen, J. Reine Angew. Math. 127 (1904) 20-50.
285. I. Schur, Untersuchungen über die Darstellung der endlichen Gruppen durch gebrochene lineare Substiutionen, J. Reine Angew. Math. 132 (1907) 85-137.
286. I. Schur, Über die Darstellung der symmetrischen und der alternierenden Gruppe durch gebrochene lineare Substiutionen, J. Reine Angew. Math. 139 (1911) 155-250.
287. J. Seberry, website http://www.uow.edu.au/jennie/.
288. J. Seberry and M. Yamada, Hadamard matrices, sequences, and block designs, Chapter 11, Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson, eds., Wiley, New York, 1992.
289. Y. Shaked and A. Wool, Cracking the Bluetooth PIN, Proc. MobiSys '05, ACM Press, New York, 2005, 39-50.
290. C. E. Shannon, A mathematical theory of communication, Bell System Tech. J. 27 (1948) 379-423, 623-656.
291. V. Shashidhar and B. Sundar Rajan, Consta-dihedral codes and their transform domain characterization, Proc. 2004 ISIT, IEEE, 2004, 256.
292. P. J. Shlichta, Three- and four-dimensional Hadamard matrices, Bull. Amer. Phys. Soc. 16(8) (1971) 825-826.
293. P. J. Shlichta, Higher dimensional Hadamard matrices, IEEE Trans. Inform. Theory 25 (1979) 566-572.
294. V. M. Sidel'nikov, On the mutual correlation of sequences, Soviet Math. Dokl. 12 (1971) 197-201.
295. M. K. Siu, The combinatorics of binary arrays, J. Stat. Plann. Inf. 62 (1997) 103-113.
296. D. Slepian, Group codes for the Gaussian channel, Bell Syst. Tech. J. 47 (1968) 575-602.
297. N. Sloane, website http://www.research.att.com/njas/hadamard/.
298. E. D. J. Smith, R. J. Blaikie and D. P. Taylor, Performance enhancement of spectral-amplitude coding optical CDMA using pulse-position modulation, IEEE Trans. Communications 46 (9) (1998) 1176-1185.
299. K.W. Smith, Nonabelian Hadamard difference sets, J. Combin. Theory A 70 (1995) 144-156.
300. P. Solé, A quaternary cyclic code and a family of quadriphase sequences with low correlation properties, Coding Theory and Applications, LNCS 388, Springer, Berlin, 1989, 193-201.
301. H. Y. Song and S. W. Golomb, On the existence of cyclic Hadamard difference sets, IEEE Trans. Inform. Theory 40 (1994) 1266-1268.
302. T. St Denis, Fast Pseudo-Hadamard Transforms, Cryptology ePrint Archive, Report 2004/010, http://eprint.iacr.org/, last revised 2 February 2004.
303. J. J. Sylvester, Thoughts on inverse orthogonal matrices, simultaneous sign successions and tesselated pavements in two or more colours, with applications to Newton's rule, ornamental tile work and the theory of numbers, Phil. Mag. 34 (1867) 461-475.
304. W. Tadej and K. Zyczkowski, A concise guide to complex Hadamard matrices, Open Sys. & Information Dyn. 13 (2006) 133-177.
305. V. Tarokh, H. Jafarkhani and A. R. Calderbank, Space-time block codes from orthogonal designs, IEEE Trans. Inform. Theory 45 (1999) 1456-1467.
306. V. D. Tonchev, Hadamard matrices of order 36 with automorphisms of order 17, Nagoya Math. J. 104 (1986) 163-174.
307. V. D. Tonchev, Self-orthogonal designs and extremal doubly even codes, J. Combin. Theory A 52 (1989) 197-205.
308. R. J. Turyn, Complex Hadamard matrices, Combinatorial Structures and Their Applications, Gordon and Breach, New York, 1970, 435-437.
309. R. J. Turyn, An infinite class of Williamson matrices, J. Combin. Theory A 12 (1972) 319-321.
310. P. Udaya and K. J. Horadam, Cocyclic Hadamard codes from semifields, Proc. 2000 ISIT, IEEE, 2000, 31.
311. S. A. Vanstone and P. C. van Oorschot, An Introduction to Error Correcting Codes with Applications, Kluwer, Boston, 1989.
312. S. Verdu, Multiuser Detection, CUP, Cambridge, 1998.
313. J. S. Wallis, On the existence of Hadamard matrices, J. Combin. Theory A 21 (1976) 188-195.
314. W. D. Wallis, Combinatorial Designs, Marcel Dekker, New York, 1988.
315. W. D. Wallis, A. P. Street and J. S. Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, LNM 292, Springer, Berlin, 1972.
316. J. L. Walsh, A closed set of normal orthogonal functions, Amer. J. Math. 55 (1923) 5-24.
317. Z.-X. Wan, Quaternary Codes, World Scientific, Singapore, 1997.
318. J. Wang and T. S. Ng, eds., Advances in 3G Enhanced Technologies for Wireless Communications, Artech House, Norwood, 2002.
319. A. F. Webster and S. E. Tavares, On the design of S-boxes, CRYPTO 85, LNCS 218, Springer, Berlin, 1986, 523-534.
320. Z. Wen and Y. Tao, Orthogonal codes and cross-talk in phase-code multiplexed volume holographic data storage, Opt. Commun. 148 (1998) 11-17.
321. S. B. Wicker, Error Control Systems for Digital Communication and Storage, Prentice-Hall, Upper Saddle River, 1995.
322. W. Willems, A note on self-dual group codes, IEEE Trans. Inform. Theory 48 (2002) 3107-3109.
323. J. Williamson, Hadamard's determinant theorem and the sum of four squares, Duke Math J. 11 (1944) 65-81.
324. R. M. Wilson and Q. Xiang, Constructions of Hadamard difference sets, J. Combin. Theory A 77 (1997) 148-160.
325. A. Winterhof, On the non-existence of generalised Hadamard matrices, J. Statist. Plann. Inference 84 (2000) 337-342.
326. J. Wolfmann, Bent functions and coding theory, Difference Sets, Sequences and Their Correlation Properties, A. Pott et al., eds., NATO Science Series C, 542, Kluwer, Dordrecht, 1999, 393-418.
327. M.-Y. Xia, Some infinite classes of special Williamson matrices and difference sets, J. Combin. Theory A 61 (1992) 230-242.
328. M. Yamada, Hadamard matrices of generalised quaternion type, Discr. Math. 87 (1991) 187-196.
329. K. Yamamoto, On a generalised Williamson equation, Colloq. Math. Soc. Janos Bolyai 37 (1981) 839-850.
330. X. Y. Yang and S. Jutamulia, Three-dimensional photorefractive memory based on phase-code and rotation multiplexing, Proc. IEEE 87 (11) (1999) 1941-1955.
331. Y. X. Yang, The proofs of some conjectures on higher dimensional Hadamard matrices, Kexue Tongbao (English translation) 31 (1986) 1662-1667.
332. Y. X. Yang, Existence of one-dimensional perfect binary arrays, Electron. Lett. 23 (1987) 1277-1278.
333. Y. X. Yang, On the H-Boolean functions, J. Beijing Uni. Posts and Telecomm. 11 (1988) 1-9.
334. Y. X. Yang, Theory and Applications of Higher-Dimensional Hadamard Matrices, Kluwer, Dordrecht, 2001.
335. G. J. Yu, C. S. Lu and H. Y. Liao, A message-based cocktail watermarking system, Pattern Recognition 36 (2003) 957-968.