Extending binary sequences to maximum length sequences

DOI10.1007/S10623-026-01925-8MaRDI QIDQ7363325zbMATH OpenFDO

Authors Yupeng Jiang, Ming Li, Junying Liu, Dongdai Lin

Publication date 29 September 2026

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

Full work available at URL https://doi.org/10.1007/S10623-026-01925-8

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites work

• A problem in arrangements
• A simple combinatorial algorithm for de Bruijn sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• scientific article; zbMATH DE number 6900646 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Longest subsequences shared by two de Bruijn sequences
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• On extending de Bruijn sequences
• On greedy algorithms for binary de Bruijn sequences
• On prefer-one sequences
• Partial Cycle Structure of FSRs and Its Applications in Searching De Bruijn Sequences
• Spans of preference functions for de Bruijn sequences

This page was built for publication: Extending binary sequences to maximum length sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363325)