Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 2/2017

01-12-2016

Construction for de Bruijn sequences with large stage

Authors: Junwu Dong, Dingyi Pei

Published in: Designs, Codes and Cryptography | Issue 2/2017

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.
previous article Nonlinear functions and difference sets on group actions
next article Some properties of skew codes over finite fields
Literature
1.
de Bruijn N.: A combinatorial problem. Proc. Kon. Ned. Akad. Wetensch. 49, 758–764 (1946).MATH
2.
Fredricksen H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24, 195–221 (1982) (49, 758–764).
3.
Golomb S.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1982).MATH
4.
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
5.
Annexstein F.S.: Generating de Bruijn sequences: an efficient implementation. IEEE Trans. Comput. 46, 198–200 (1997).CrossRef
6.
7.
Games Richard A.: A generalized recursive construction for de Bruijn sequence. IEEE Trans. Inf. Theory 29(6), 843–850 (1983).
8.
Etzion T., Lempel A.: Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inf. Theory 30, 480–484 (1984).MathSciNetCrossRefMATH
9.
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.
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.
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.
Metadata
Title
Construction for de Bruijn sequences with large stage
Authors
Junwu Dong
Dingyi Pei
Publication date
01-12-2016
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 2/2017
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-016-0309-1

Other articles of this Issue 2/2017

Designs, Codes and Cryptography 2/2017 Go to the issue

OriginalPaper

New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4

OriginalPaper

Anonymous and leakage resilient IBE and IPE

OriginalPaper

Linearly embeddable designs

OriginalPaper

Equivalences among plateaued APN functions

OriginalPaper

Nonlinear functions and difference sets on group actions

OriginalPaper

Bounds and constructions of t-spontaneous emission error designs

Premium Partner

    Image Credits