References

• 1. 1)
     • 7. Sidelnikov, V.M.: ‘Some k-valued pseudo-random sequences and nearly equidistant codes’, Probl. Inf. Transm., 1969, 5, (1), pp. 12–16.
  2. 2)
     • 4. Ding, C., Helleseth, T., Martinsen, H.: ‘New families of binary sequences with optimal three-valued autocorrelation’, IEEE Trans. Inf. Theory, 2001, 47, (1), pp. 428–433 (doi: 10.1109/18.904555).
  3. 3)
     • 6. Ding, C., Helleseth, T., Lam, K.Y.: ‘Several classes of binary sequences with three-level autocorrelation’, IEEE Trans. Inf. Theory, 1999, 44, (7), pp. 2601–2606, doi: 10.1109/18.796414.
  4. 4)
     • 3. Lempel, A., Cohn, M., Eastman, W.: ‘A class of balanced binary sequences with optimal autocorrelation property’, IEEE Trans. Inf. Theory, 1977, 23, (1), pp. 38–42 (doi: 10.1109/TIT.1977.1055672).
  5. 5)
     • 13. Yan, S.Y.: ‘Number theory for computing’ (Springer-Verlag, Berlin, Heidelberg, 2002, 2nd edn.).
  6. 6)
     • 14. Helleseth, T., Yang, K.: ‘On binary sequences n = pm−1 with optimal autocorrelation’. SETA '01, Discrete Mathematics and Theoretical Computer Science, Bergen, Norway, May 2001, pp. 209–217, doi: 10.1007/978-1-4471-0673-9.
  7. 7)
     • 12. Bradley, S.P., Pott, P.: ‘Existence and nonexistence of almost-perfect autocorrelation sequences’, IEEE Trans. Inf. Theory, 1995, 41, (1), pp. 301–304 (doi: 10.1109/18.370094).
  8. 8)
     • 2. Golomb, S.W., Gong, G.: ‘Signal design for good correlation - for wireless communication, cryptography and radar’ (Cambridge University Press, USA, 2005).
  9. 9)
     • 1. Fan, P., Darnell, M.: ‘Sequence design for communications applications’ (Research Studies Press Ltd., England, London, 1996).
  10. 10)
      • 15. Berlecamp, E.R.: ‘Algebraic coding theory’ (McGraw-Hill, Inc., New-York, 1968).
  11. 11)
      • 11. Langevin, P.: ‘Almost perfect binary functions’, Appl. Algebra Eng. Commun. Comput., 1993, 4, (2), pp. 95–102 (doi: 10.1007/BF01386833).
  12. 12)
      • 5. Tang, X., Gong, G.: ‘New constructions of binary sequences with optimal autocorrelation value/magnitude’, IEEE Trans. Inf. Theory, 2010, 56, (3), pp. 1278–1286 (doi: 10.1109/TIT.2009.2039159).
  13. 13)
      • 9. Yu, N.Y., Gong, G.: ‘New binary sequences with optimal autocorrelation magnitude’, IEEE Trans. Inf. Theory, 2008, 54, (10), pp. 4771–4779 (doi: 10.1109/TIT.2008.928999).
  14. 14)
      • 8. Arasu, K.T.: ‘Sequences and arrays with desirable correlation properties’ inCrnković, D., Tonchev, V. (Eds.): ‘Information Security, Coding Theory and Related Combinatories’ (the authors and IOS Press, USA and Canada, 2011, doi: 10.3233/978-1-60750-663-8-136).
  15. 15)
      • 10. Wolfmann, J.: ‘Almost perfect autocorrelation sequences’, IEEE Trans. Inf. Theory, 1992, 38, (4), pp. 1412–1418 (doi: 10.1109/18.144729).