Properties of the cycles that contain all vectors of weight k

DOI10.1007/S10623-022-01100-9MaRDI QIDQ2678985zbMATH OpenOpenAlexWikidataFDO

Authors Ming Li, Yupeng Jiang, Dongdai Lin

Publication date 18 January 2023

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

Full work available at URL https://doi.org/10.1007/s10623-022-01100-9

zbMATH Keywords

de Bruijn sequenceHamming weightuniversal cyclecycle joining methodpure circulating register

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)

Recommendations

• Extreme weight classes of de Bruijn sequences
• Self-dual sequences
• Further results on the Bruijn weight classes
• De Bruijn sequences for fixed-weight binary strings
• Generalized de Bruijn cycles

Cites work

• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A class of nonlinear de Bruijn cycles
• Algorithms for the generation of full-length shift- register sequences
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• Binary bubble languages and cool-lex order
• Constructing the first (and coolest) fixed-content universal cycle
• De Bruijn sequences for fixed-weight binary strings
• De Bruijn sequences for the binary strings with maximum density
• De Bruijn sequences, irreducible codes and cyclotomy
• Double Adjacencies Between Cycles of a Circulating Shift Register
• Efficient generation of the binary reflected gray code and its applications
• Extreme weight classes of de Bruijn sequences
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Nonlinear shift registers that produce all vectors of weight >or=t
• On the classification of deBruijn sequences
• On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions
• Self-dual sequences
• Shift Register Sequences
• Symmetry types of periodic sequences
• The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials
• The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• The number of nonlinear shift registers that produce all vectors of weight >or=t
• Universal Cycles for Weight-Range Binary Strings
• Universal cycles for combinatorial structures

Cited in

(1)

• On the cycles and adjacencies in the complementary circulating register

This page was built for publication: Properties of the cycles that contain all vectors of weight \(\le k\)

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