DOI QR코드

DOI QR Code

ANALYSIS OF THE SEQUENCES WITH OPTIMAL CROSS-CORRELATION PROPERTY

  • Kwon, Min-Jeong (Department of Applied Mathematics, Pukyong National University) ;
  • Cho, Sung-Jin (Department of Applied Mathematics, Pukyong National University)
  • Received : 2013.01.31
  • Accepted : 2013.03.25
  • Published : 2013.09.30

Abstract

The design of large family size with the optimal cross-correlation property is important in spread spectrum and code division multiple access communication systems. In this paper we present the sequences with the decimation $d=2{\cdot}2^m-1$, calculate the cross-correlation spectrum for $0{\leq}t{\leq}2^n-2$ and count the number of the value $2^m-1$ occurring for $0{\leq}{\tau}2^n-2$. The sequences have the optimal cross-correlation property. The work on this paper can make it easier to count the number of the whole value occurring for $0{\leq}{\tau}2^n-2$.

Keywords

References

  1. S.W. Golomb, Shift register sequences, Holden Day, 1967.
  2. R. Gold, Optimal binary sequences for spread spectrum multiplexing, IEEE Transactions on Information Theory, 13 (1967), 619-621. https://doi.org/10.1109/TIT.1967.1054048
  3. R. Gold, Maximal recursive sequences with 3-valued recursive cross-correlation functions, IEEE Transactions on Information Theory, 14 (1968), 154-156. https://doi.org/10.1109/TIT.1968.1054106
  4. H.D. Kim, S.J. Cho, A New Proof about the decimation with Niho type fice-valued cross-correlation functions, J. Appl. Math. and Inform. 30 (2012), 903-911.
  5. T. Helleseth, Some results about the cross-correlation function between two maximal linear sequences, Discrete Mathematics, 16 (1976), 209-232. https://doi.org/10.1016/0012-365X(76)90100-X
  6. T. Helleseth, A note on the cross-correlation function between two binary maximal length linear sequences, Discrete Mathematics, 23 (1978), 301-307. https://doi.org/10.1016/0012-365X(78)90010-9
  7. T. Helleseth, J. Lahtonen, and P. Rosendahl,On certain equations over finite fields and cross-correlations of m-sequences, Coding, Cryptography and Combinatorics, Progress in Computer Science and Applied Logic, 23 (1984), 169-176.
  8. T. Kasami, Weight distribution of Bose-Chaudhuri-Hocquenghem codes, Combinatorial Mathematics and Its Applications, Chapel Hill, N.C., University of North Carolina Press, 1969.
  9. R. Lidl and H. Niederreiter, Finite fields, Cambridge University Press, 1997.
  10. R.J. McEliece, Correlation properties of sets of sequences derived from irreducible cyclic codes, Information and Control, 45 (1980), 18-25. https://doi.org/10.1016/S0019-9958(80)90827-X
  11. Y. Niho, Multi-valued cross-correlation functions between two maximal linear recursive sequences, Ph.D thesis, University of Southern California, 1972.
  12. D.V. Sarwate, M.B. Purseley, Crosscorrelation properties of pseudorandom and related sequences, Proceedings of the IEEE, 68 (1980), 593-619. https://doi.org/10.1109/PROC.1980.11697
  13. R.A. Scholtz and L.R.Welch, GMW sequences, IEEE Transactions on Information Theory, 30 (1984), 548-553. https://doi.org/10.1109/TIT.1984.1056910
  14. E.S. Selmer, Linear Recurrence Relations over Finite Fields, University of Bergen, 1966.
  15. M. Simon, J. Omura, R. Scholtz, B. Levitt, Spread Spectrum Communications, Computer Science Press, 1985.
  16. L.R. Welch, Lower bounds on the maximum cross-correlation of signals, IEEE Transac-tions on Information Theory, 20 (1974), 397-399. https://doi.org/10.1109/TIT.1974.1055219
  17. N. Zierler, Linear recurring sequences, Journal of the Society for Industrial and Applied Mathematics, 7 (1976), 31-48.