An interleaved method for constructing de Bruijn sequences
From MaRDI portal
Publication:1720333
DOI10.1016/j.dam.2018.06.032zbMath1412.94149OpenAlexW2893091540MaRDI QIDQ1720333
Tian Tian, Wen-Feng Qi, Xiao-Xin Zhao
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.032
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A surprisingly simple de Bruijn sequence construction
- A recursive construction of nonbinary de Bruijn sequences
- New stream cipher designs. The eSTREAM finalists
- Generation of some de Bruijn sequences
- A class of nonlinear de Bruijn cycles
- Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
- A Class of de Bruijn Sequences
- The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs
- A generalized recursive construction for de Bruijn sequences
- Algorithms for the generation of full-length shift- register sequences
- An efficient algorithm for the generation of DeBruijn cycles
- Cryptographically Strong de Bruijn Sequences with Large Periods
- Trivium
- On the cycle structure of some nonlinear shift register sequences
- A large class of nonlinear shift register sequences (Corresp.)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- A method for constructing decodable de Bruijn sequences
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
This page was built for publication: An interleaved method for constructing de Bruijn sequences