Generation of full cycles by a composition of NLFSRs

DOI10.1007/s10623-014-9947-3zbMath1335.94023OpenAlexW2047978026MaRDI QIDQ398953

Elena Dubrova

Publication date: 18 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-014-9947-3

zbMATH Keywords

de Bruijn sequenceLFSRfull cyclemaximum periodNLFSR

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Longest subsequences shared by two de Bruijn sequences

Cites Work

• A class of nonlinear de Bruijn cycles
• A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs
• Algorithms for the generation of full-length shift- register sequences
• Shift Register Sequences – A Retrospective Account
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• The number of cross-join pairs in maximum length linear sequences
• An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
• A Computational Scheme Based on Random Boolean Networks
• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generation of full cycles by a composition of NLFSRs