Extended hadamard equivalence

Authors:
Doreen Hertel
Affiliations:
Institute for Algebra and Geometry, Faculty of Mathematics, Otto-von-Guericke-University Magdeburg, Magdeburg, Germany
Venue:
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Year:
2006

Citing 3
Cited 2

Multiplicative Difference Sets via Additive Characters

Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar

Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
New cyclic difference sets with Singer parameters

Finite Fields and Their Applications

Abelian difference sets of order n dividing λ

Designs, Codes and Cryptography
Multiplexing Realizations of the Decimation-Hadamard Transform of Two-Level Autocorrelation Sequences

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology

Quantified Score

Hi-index	0.00

Visualization

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.