nach oben

Designs, Codes and Cryptography

Erschienen in:

01.12.2016

Construction for de Bruijn sequences with large stage

verfasst von: Junwu Dong, Dingyi Pei

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2/2017

Einloggen, um Zugang zu erhalten

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

search-config

KI-gestützte Suche

Aus

Abstract

Sequences generated by maximum-period nonlinear feedback shift registers are known as de Bruijn sequences. The problem of generating de Bruijn sequences has received considerable attention. In this paper, we provide a method for generating large state (such as \(n=128\)) de Bruijn sequences.

Vorheriger Artikel Nonlinear functions and difference sets on group actions

Nächster Artikel Some properties of skew codes over finite fields

de Bruijn N.: A combinatorial problem. Proc. Kon. Ned. Akad. Wetensch. 49, 758–764 (1946).MATH

Fredricksen H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24, 195–221 (1982) (49, 758–764).

Golomb S.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1982).MATH

Lempel A.: On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers. IEEE Trans. Comput. C19, 1204–1209 (1970).MathSciNetCrossRefMATH

Annexstein F.S.: Generating de Bruijn sequences: an efficient implementation. IEEE Trans. Comput. 46, 198–200 (1997).CrossRef

Alhakim A., Akinwande M.: A recursive construction of nonbinary de Bruijn sequences. Des. Codes Cryptogr. 60, 155–169 (2011).MathSciNetCrossRefMATH

Games Richard A.: A generalized recursive construction for de Bruijn sequence. IEEE Trans. Inf. Theory 29(6), 843–850 (1983).

Etzion T., Lempel A.: Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inf. Theory 30, 480–484 (1984).MathSciNetCrossRefMATH

Jansen C.J.A.: An efficient algorithm for the generation of de Bruijn cycles. IEEE Trans. Inf. Theory 37, 1475–1478 (1991).MathSciNetCrossRefMATH

10.

Yang J.H., Dai Z.D.: Construction of \(m\)-ary de Bruijn sequences. In: Advances in Cryptology-AUSCRYPT’92 LNCS, vol. 718, pp. 357–363 (1993).

11.

Mykkeltveit J., Siu M.K., Tong P.: On the cycle structure of some nonlinear shift register sequences. Inf. Control 43(2), 202–215 (1979).

12.

Fredricksen H.: A class of nonlinear de Bruijn cycles. J. Comb. Theory Ser. A 19, 192–199 (1975).MathSciNetCrossRefMATH

13.

Helleseth T., Klove T.: The number of cross-join pairs in maximum length linear sequences. IEEE Trans. Inf. Theory 37(6), 1731–1733 (1991).MathSciNetCrossRefMATH

14.

Dubrova E.: A scalable method for constructing Galois NLFSRs with period \(2^n-1\) using cross-join pairs. IEEE Trans. Inf. Theory 59(1), 703–709 (2013).MathSciNetCrossRefMATH

15.

Mykkeltveit J., Szmidt J.: On cross joining de Bruijn sequences. Contemp. Math. 632, 333–344 (2015).MathSciNetMATH

16.

Chang T., Song I., Cho S.H.: Some properties of cross-join pairs in maximum length linear sequences. In: Proceeding of ISZTA’90, pp. 1077–1079 (1990).

17.

Li C.Y., Zeng X., Helleseth T., et al.: The properties of a class of linear FSRs and their applications to the construction of nonlinear FSRs. IEEE Trans. Inf. Theory 60(5), 3052–3061 (2014).MathSciNetCrossRefMATH

18.

Li C.Y., Zeng X.Y., Li C.L., et al.: A class of de Bruijn sequences. IEEE Trans. Inf. Theory 60(12), 7955–7969 (2014).MathSciNetCrossRefMATH

19.

Li C.Y., Zeng X.Y., Li C.L., Helleseth T., Li M.: Construction of de Bruijn sequences from LFSRs with reducible characteristic polynomial. IEEE Trans. Inf. Theory 63(1), 610–624 (2016).MathSciNetCrossRefMATH

20.

Li M., Jiang Y., Lin D.: The adjacency graphs of some feedback shift register. Des. Codes Cryptogr. doi:10.1007/s10623-016-0187-6.

Titel: Construction for de Bruijn sequences with large stage
verfasst von: Junwu Dong
Dingyi Pei
Publikationsdatum: 01.12.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 2/2017
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0309-1

Springer Professional

Construction for de Bruijn sequences with large stage

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 2/2017

Equivalences among plateaued APN functions

Nonlinear functions and difference sets on group actions

Linearly embeddable designs

Bounds and constructions of t-spontaneous emission error designs

Cyclic subspace codes via subspace polynomials

Stretching de Bruijn sequences

Premium Partner