Longest subsequences shared by two de Bruijn sequences

DOI10.1007/s10623-020-00759-2zbMath1448.94181OpenAlexW3019769817MaRDI QIDQ780381

Yupeng Jiang, Dong-Dai Lin

Publication date: 15 July 2020

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

Full work available at URL: https://doi.org/10.1007/s10623-020-00759-2

zbMATH Keywords

de Bruijn sequencecross-join operationcross-join pairprefer-one sequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further results on the nonlinearity of maximum-length NFSR feedbacks
• Generation of full cycles by a composition of NLFSRs
• The adjacency graphs of some feedback shift registers
• Further results on correlation functions of de Bruijn sequences
• A class of nonlinear de Bruijn cycles
• Weight class distributions of de Bruijn sequences
• The analysis of de Bruijn sequences of non-extremal weight
• Construction of de Bruijn sequences from product of two irreducible polynomials
• On the complexities of de-Bruijn sequences
• Extreme weight classes of de Bruijn sequences
• On the classification of deBruijn sequences
• On the nonlinearity of maximum-length NFSR feedbacks
• Construction for de Bruijn sequences with large stage
• Generation of the Ford sequence of length \(2^ n\), n large
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• A Class of de Bruijn Sequences
• Feedback Reconstruction and Implementations of Pseudorandom Number Generators from Composited De Bruijn Sequences
• The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials
• On cross joining de Bruijn sequences
• Construction of de Bruijn sequences of minimal complexity
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• The number of cross-join pairs in maximum length linear sequences
• Efficient Composited de Bruijn Sequence Generators
• Linear complexity of de Bruijn sequences-old and new results
• A problem in arrangements
• The lexicographically least de Bruijn cycle
• Further results on the Bruijn weight classes

This page was built for publication: Longest subsequences shared by two de Bruijn sequences