Skip to main content
Erschienen in: Applicable Algebra in Engineering, Communication and Computing 5-6/2012

01.12.2012 | Original Paper

Remarks on the generalized cyclotomic sequences of length \(2p^{m}\)

verfasst von: Lin Tan, Hong Xu, Wen-Feng Qi

Erschienen in: Applicable Algebra in Engineering, Communication and Computing | Ausgabe 5-6/2012

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper presents some nonrandom distribution properties of two generalized cyclotomic binary sequences of length \(2p^{m}\) constructed by Zhang et al. (Appl Algebra Eng Commun Comput 21:93–108, 2010). Using these properties we further study the \(k\)-error linear complexity and autocorrelation of these sequences. For some small values of \(k\), the upper bounds on the \(k\)-error linear complexity are derived, which are far less than their linear complexity. Finally the bounds on the autocorrelation of these sequences are also presented. Our results show that there exist some drawbacks in application of these two sequences.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Bai, E., Liu, X., Xiao, G.: Linear complexity of new generalized cyclotomic squences of order two of length \(pq\). IEEE Trans. Inf. Theory 51(5), 1849–1853 (2005)MathSciNetMATHCrossRef Bai, E., Liu, X., Xiao, G.: Linear complexity of new generalized cyclotomic squences of order two of length \(pq\). IEEE Trans. Inf. Theory 51(5), 1849–1853 (2005)MathSciNetMATHCrossRef
2.
Zurück zum Zitat Cesmelioglu, A., Meidl, W.: A general approach to construction and determination of the linear complexity of sequences based on cosets. In: Sequences and Their Applications. Lecture Notes in Computer Science, vol. 6338, pp. 125–138. Springer-Verlag, Berlin (2010) Cesmelioglu, A., Meidl, W.: A general approach to construction and determination of the linear complexity of sequences based on cosets. In: Sequences and Their Applications. Lecture Notes in Computer Science, vol. 6338, pp. 125–138. Springer-Verlag, Berlin (2010)
3.
Zurück zum Zitat Dai, Z., Yang, J., Gong, G., Wang, P.: On the linear complexity of generalized Legendre sequences. In: Sequences and Their Applications (2001), Discrete Mathematics and Theoretical Computer Science (London). pp. 145–153. Springer, London (2002) Dai, Z., Yang, J., Gong, G., Wang, P.: On the linear complexity of generalized Legendre sequences. In: Sequences and Their Applications (2001), Discrete Mathematics and Theoretical Computer Science (London). pp. 145–153. Springer, London (2002)
4.
Zurück zum Zitat Ding, C., Hellseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44(3), 1276–1278 (1998)CrossRef Ding, C., Hellseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44(3), 1276–1278 (1998)CrossRef
6.
7.
Zurück zum Zitat Ding, C.: Autocorrelation values of generalized cyclotomic sequences of order 2. IEEE Trans. Inf. Theory 44(4), 1699–1702 (1998)MATHCrossRef Ding, C.: Autocorrelation values of generalized cyclotomic sequences of order 2. IEEE Trans. Inf. Theory 44(4), 1699–1702 (1998)MATHCrossRef
8.
Zurück zum Zitat Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. Lecture Notes in Computer Science, vol. 561, Springer, Berlin (1991) Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. Lecture Notes in Computer Science, vol. 561, Springer, Berlin (1991)
9.
Zurück zum Zitat Kim, Y.J., Jin, S.Y., Song, H.Y.: Linear complexity and autocorrelation of prime cube sequences. In: Boztas S., Lu H.-F. (eds.) LNCS 4851. vol. 17, pp. 188–197, Applicable Algebra in Engineering, Communication and Computing (2007) Kim, Y.J., Jin, S.Y., Song, H.Y.: Linear complexity and autocorrelation of prime cube sequences. In: Boztas S., Lu H.-F. (eds.) LNCS 4851. vol. 17, pp. 188–197, Applicable Algebra in Engineering, Communication and Computing (2007)
11.
Zurück zum Zitat Nathanson, M.B.: Elementary Methods in Number Theory. Springer, Berlin, GTM 195 (2003) Nathanson, M.B.: Elementary Methods in Number Theory. Springer, Berlin, GTM 195 (2003)
12.
Zurück zum Zitat Stamp, M., Martin, C.F.: An algorithm for the \(k\)-error linear complexity of binary sequences with period \(2^{n}\). IEEE Trans. Inf. Theory 39(4), 1398–1401 (1993)MathSciNetMATHCrossRef Stamp, M., Martin, C.F.: An algorithm for the \(k\)-error linear complexity of binary sequences with period \(2^{n}\). IEEE Trans. Inf. Theory 39(4), 1398–1401 (1993)MathSciNetMATHCrossRef
13.
Zurück zum Zitat Yan, T., Sun, R., Xiao, G.: Autocorrelation and linear complexity of the new generalized cyclotomic sequences. IEICE Trans. Fundam. E90-A 4, 857–864 (2007)CrossRef Yan, T., Sun, R., Xiao, G.: Autocorrelation and linear complexity of the new generalized cyclotomic sequences. IEICE Trans. Fundam. E90-A 4, 857–864 (2007)CrossRef
14.
Zurück zum Zitat Yan, T., Li, S., Xiao, G.: On the linear complexity of generalized cyclotomic sequences with the period \(p^{m}\). Appl. Math. Lett. 21, 187–193 (2008)MathSciNetMATHCrossRef Yan, T., Li, S., Xiao, G.: On the linear complexity of generalized cyclotomic sequences with the period \(p^{m}\). Appl. Math. Lett. 21, 187–193 (2008)MathSciNetMATHCrossRef
15.
Zurück zum Zitat Zhang, J., Zhao, C., Ma, X.: Linear complexity of generalized cyclotomic sequences with length \(2p^{m}\). Appl. Algebra Eng. Commun. Comput. 21, 93–108 (2010)MathSciNetMATHCrossRef Zhang, J., Zhao, C., Ma, X.: Linear complexity of generalized cyclotomic sequences with length \(2p^{m}\). Appl. Algebra Eng. Commun. Comput. 21, 93–108 (2010)MathSciNetMATHCrossRef
Metadaten
Titel
Remarks on the generalized cyclotomic sequences of length
verfasst von
Lin Tan
Hong Xu
Wen-Feng Qi
Publikationsdatum
01.12.2012
Verlag
Springer-Verlag
Erschienen in
Applicable Algebra in Engineering, Communication and Computing / Ausgabe 5-6/2012
Print ISSN: 0938-1279
Elektronische ISSN: 1432-0622
DOI
https://doi.org/10.1007/s00200-012-0177-5

Premium Partner