Properties of the cycles that contain all vectors of weight k
DOI10.1007/S10623-022-01100-9OpenAlexW4294762995WikidataQ114226814 ScholiaQ114226814MaRDI QIDQ2678985FDOQ2678985
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
Recommendations
Analysis of algorithms (68W40) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)
Cites Work
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Universal cycles for combinatorial structures
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Symmetry types of periodic sequences
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- De Bruijn sequences for fixed-weight binary strings
- Binary bubble languages and cool-lex order
- A class of nonlinear de Bruijn cycles
- Algorithms for the generation of full-length shift- register sequences
- Universal Cycles for Weight-Range Binary Strings
- De Bruijn sequences for the binary strings with maximum density
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- Efficient generation of the binary reflected gray code and its applications
- On the classification of deBruijn sequences
- The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs
- Extreme weight classes of de Bruijn sequences
- The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials
- On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions
- Shift Register Sequences
- De Bruijn sequences, irreducible codes and cyclotomy
- Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
- Double Adjacencies Between Cycles of a Circulating Shift Register
- Self-dual sequences
- The number of nonlinear shift registers that produce all vectors of weight >or=t
- Nonlinear shift registers that produce all vectors of weight >or=t
- Constructing the first (and coolest) fixed-content universal cycle
Cited In (1)
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)