Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Kongresse
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Veranstaltungskalender Awards MyNewsletter Firmensuche
Kunden Login
Über Einzelzugang informieren
Über Unternehmenszugang informieren
Referenzkunden
Elektrische Antriebe und Energiesysteme 2025 | 26 + 27 März 2025

19. Internationaler MTZ-Fachkongress Zukunftsantriebe

Seien Sie bei der Konferenz dabei! Dort treffen Experten aus der Automobilindustrie, Energieerzeugung und Stromnetzbetrieb auf Vertreter aus Politik und Wissenschaft. Diskutiert werden wichtige Themen der Branche.
Erweiterte Suche
Anmelden
nach oben
Applicable Algebra in Engineering, Communication and Computing
Erschienen in:

07.09.2022 | Original Paper

Balance, pattern distribution and linear complexity of M-ary sequences from Sidel’nikov sequences

verfasst von: Huaning Liu, Yixin Ren

Erschienen in: Applicable Algebra in Engineering, Communication and Computing | Ausgabe 5/2024

Einloggen

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

search-config
loading …

Abstract

Kim, Chung, No and Chung introduced new families of M-ary sequences by using Sidel’nikov sequences and the shift-and-add method. Chung, No and Chung constructed more families of M-ary sequences based on Sidel’nikov sequences and the shift-and-inverse method. In this paper we further study the balancedness of these sequences and show that they have asymptotical uniform pattern distributions under some assumptions on the parameters of the sequences. Linear complexity profiles of the sequences are also studied.
Vorheriger Artikel Two modifications for Loidreau’s code-based cryptosystem
Nächster Artikel Note on the dimension of Goppa codes

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Literatur
1.
Alaca, S., Millar, G.: Character values of the Sidelnikov–Lempel–Cohn–Eastman sequences. Cryptogr. Commun. 9(6), 665–682 (2017)MathSciNetCrossRef
2.
Alaca, S., Millar, G.: Shift-inequivalent decimations of the Sidelnikov–Lempel–Cohn–Eastman sequences. Des. Codes Cryptogr. 88(3), 567–583 (2020)MathSciNetCrossRef
3.
Aly, H., Meidl, W.: On the linear complexity and \(k\)-error linear complexity over \({\mathbb{F} }_p\) of the \(d\)-ary Sidelnikov sequence. IEEE Trans. Inf. Theory 53(12), 4755–4761 (2007)CrossRef
4.
Aly, H., Winterhof, A.: On the \(k\)-error linear complexity over \({\mathbb{F} }_p\) of Legendre and Sidelnikov sequences. Des. Codes Cryptogr. 40(3), 369–374 (2006)MathSciNetCrossRef
5.
Brandstätter, N., Meidl, W.: On the linear complexity of Sidelnikov sequences over \({\mathbb{F}}_d\). In: Proceedings of SETA’06, Lecture Notes in Comput. Sci., vol. 4086, pp. 47–60. Springer, Berlin, Heidelberg (2006)
6.
Brandstätter, N., Meidl, W.: On the linear complexity of Sidelnikov sequences over nonprime fields. J. Complex. 24(5–6), 648–659 (2008)MathSciNetCrossRef
7.
Chung, J., Kim, Y., Lim, T., No, J., Chung, H.: On some properties of \(M\)-ary Sidelnikov sequences. IEICE Trans. Fundam. E92–A(1), 342–345 (2009)CrossRef
8.
Chung, J., No, J., Chung, H.: A construction of a new family of \(M\)-ary sequences with low correlation from Sidelnikov sequences. IEEE Trans. Inf. Theory 57(4), 2301–2305 (2011)CrossRef
9.
Chung, J., Yang, K.: Bounds on the linear complexity and the 1-error linear complexity over \({\mathbb{F}}_p\) of \(M\)-ary Sidelnikov sequences. In: Proceedings of SETA’06, Lecture Notes in Comput. Sci., vol. 4086, pp. 74–87. Springer, Berlin, Heidelberg (2006)
10.
Eun, Y., Song, H., Kyureghyan, G.: One-error linear complexity over Fp of Sidelnikov sequences. In: Proc. Int. Conf. Sequ. Appl., Seoul 2004, Lecture Notes in Comput. Sci., vol. 3486, pp. 154–165. Springer, Berlin, Heidelberg (2005)
11.
Garaev, M.Z., Luca, F., Shparlinski, I.E., Winterhof, A.: On the lower bound of the linear complexity over \({\mathbb{F} }_p\) of Sidelnikov sequences. IEEE Trans. Inf. Theory 52(7), 3299–3304 (2006)CrossRef
12.
Han, Y.K., Yang, K.: New \(M\)-ary sequence families with low correlation and large size. IEEE Trans. Inf. Theory 55(4), 1815–1823 (2009)MathSciNetCrossRef
13.
He, J.J., Panario, D., Wang, Q., Winterhof, A.: Linear complexity profile and correlation measure of interleaved sequences. Cryptogr. Commun. 7(4), 497–508 (2015)MathSciNetCrossRef
14.
Helleseth, T., Kim, S., No, J.: Linear complexity over \({\mathbb{F} }_p\) and trace representation of Lempel–Cohn–Eastman sequences. IEEE Trans. Inf. Theory 49(6), 1548–1552 (2003)CrossRef
15.
Helleseth, T., Maas, M., Mathiassen, J.E., Segers, T.: Linear complexity over \({\mathbb{F} }_p\) of Sidelnikov sequences. IEEE Trans. Inf. Theory 50(10), 2468–2472 (2004)CrossRef
16.
Kim, Y., Chung, J., No, J., Chung, H.: On the autocorrelation distributions of Sidelnikov sequences. IEEE Trans. Inf. Theory 51(9), 3303–3307 (2005)MathSciNetCrossRef
17.
Kim, Y., Chung, J., No, J., Chung, H.: On the linear complexity over \({\mathbb{F}}_p\) of \(M\)-ary Sidelnikov sequences. In: Proc. IEEE ISIT 2005, Sept., pp. 2007–2011 (2005)
18.
Kim, Y., Chung, J., No, J., Chung, H.: Linear complexity over \({\mathbb{F}}_p\) of ternary Sidelnikov sequences. In: Proceedings of SETA’06, Lecture Notes in Comput. Sci., vol. 4086, pp. 61–73. Springer, Berlin, Heidelberg (2006)
19.
Kim, Y., Chung, J., No, J., Chung, H.: New families of \(M\)-ary sequences with low correlation constructed from Sidelnikov sequences. IEEE Trans. Inf. Theory 54(8), 3768–3774 (2008)MathSciNetCrossRef
20.
Kim, Y., Kim, D., Song, H.: Some properties of 2-dimensional array structure of Sidelnikov sequences of period \(q^{d}-1\). In: Proceedings of IWSDA’13, pp. 20–23 (2013)
21.
Kim, Y., Kim, D., Song, H.: New \(M\)-ary sequence families with low correlation from the array structure of Sidelnikov sequences. IEEE Trans. Inf. Theory 61(1), 655–670 (2015)MathSciNetCrossRef
22.
Kim, Y., Song, H.: Cross correlation of Sidel’nikov sequences and their constant multiples. IEEE Trans. Inf. Theory 53(3), 1220–1224 (2007)CrossRef
23.
Kyureghyan, G.M., Pott, A.: On the linear complexity of the Sidelnikov–Lempel–Cohn–Eastman sequences. Des. Codes Cryptogr. 29(1–3), 149–164 (2003)MathSciNetCrossRef
24.
Lempel, A., Cohn, M., Eastman, W.L.: A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Inf. Theory IT–23(1), 38–42 (1977)MathSciNetCrossRef
25.
Meidl, W., Winterhof, A.: Some notes on the linear complexity of Sidelnikov–Lempel–Cohn–Eastman sequences. Des. Codes Cryptogr. 38(2), 159–178 (2006)MathSciNetCrossRef
26.
Sidel’nikov, V.M.: Some \(k\)-valued pseudo-random sequences and nearly equidistant codes. Probl. Inf. Transm. 5(1), 12–16 (1969)MathSciNet
27.
Wanders, H.E.: On the significance of Golomb’s randomness postulates in cryptography. Philips J. Res. 43(2), 185–222 (1988)MathSciNet
28.
Winterhof, A., Xiao, Z.: Binary sequences derived from differences of consecutive primitive roots. IEEE Trans. Inf. Theory 67(8), 5334–5338 (2021)MathSciNetCrossRef
29.
Yu, N.Y., Gong, G.: New construction of \(M\)-ary sequence families with low correlation from the structure of Sidelnikov sequences. IEEE Trans. Inf. Theory 56(8), 4061–4070 (2010)MathSciNetCrossRef
30.
Yu, N.Y., Gong, G.: Multiplicative characters, the Weil bound, and polyphase sequence families with low correlation. IEEE Trans. Inf. Theory 56(12), 6376–6387 (2010)MathSciNetCrossRef
Metadaten
Titel
Balance, pattern distribution and linear complexity of M-ary sequences from Sidel’nikov sequences
verfasst von
Huaning Liu
Yixin Ren
Publikationsdatum
07.09.2022
Verlag
Springer Berlin Heidelberg
Erschienen in
Applicable Algebra in Engineering, Communication and Computing / Ausgabe 5/2024
Print ISSN: 0938-1279
Elektronische ISSN: 1432-0622
DOI
https://doi.org/10.1007/s00200-022-00580-5

Weitere Artikel der Ausgabe 5/2024

On cryptographic properties of cubic and splitting Boolean functions

  • Open Access
  • Original Paper

Two modifications for Loidreau’s code-based cryptosystem

  • Original Paper

Strong metric dimension in annihilating-ideal graph of commutative rings

  • Original Paper

Note on the dimension of Goppa codes

  • Original Paper

On the support t-designs of extremal Type III and IV codes

  • Original Paper

Constructions of low-hit-zone frequency hopping sequence sets from cyclic codes

  • Original Paper

Premium Partner

    Bildnachweise