Abstract
Binary sequences with good autocorrelation properties are widely used in cryptography. If the autocorrelation properties are optimum, then the sequences are called perfect. All recently discovered perfect sequences of period n=2k–1 are Hadamard equivalent, when k is odd. In this paper we generalise this concept to sequences of period n=4m–1, where m is not necessarily a power of 2. Using this notion we show, that the Hall and the Legendre sequences are extended Hadamard equivalent.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dillon, J.F.: Multiplicative Difference Sets via Additive Characters. Designs, Codes and Cryptography 17(1-3), 225–235 (1999)
Dillon, J.F., Dobbertin, H.: New Cyclic Difference Sets with Singer Parameters. Finite Fields Appl. 10(3), 342–389 (2004)
Golomb, S.W., Gong, G.: Signal Design for good Correlation. For Wireless Communication, Cryptography and Radar. Cambridge University Press, Cambridge (2005)
Hall, M.: A Survey of Difference Sets. Proc. Am. Math. Soc. 7, 975–986 (1957)
Lidl, R., Niederreiter, H.: Finite Fields. In: Encyclopedia of Mathematics and its Applications, 2nd edn., vol. 20, Cambridge University Press, Cambridge (1996)
Paley, R.E.A.C.: On Orthogonal Matrices. J. Math. Phys., Mass. Inst. Techn. 12, 311–320 (1933)
Pott, A.: Finite Geometry and Character Theory. Lecture Notes in Mathematics, vol. 1601. Springer, Berlin (1995)
Storer, T.: Cyclotomy and Difference Sets. Markham Publishing Co., Chicago III (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hertel, D. (2006). Extended Hadamard Equivalence. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_10
Download citation
DOI: https://doi.org/10.1007/11863854_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44523-4
Online ISBN: 978-3-540-44524-1
eBook Packages: Computer ScienceComputer Science (R0)