The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Universal Cycles of Discrete Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal cycles of labeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles for combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for generating necklaces of beads in two colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necklaces of beads in k colors and k-ary de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal Recurring Decimals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary de Bruijn cycles under different equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorthand universal cycles for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Universal Cycles for <i>k</i>-Subsets of an <i>n</i>-Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles of \(k\)-subsets and \(k\)-permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles of classes of restricted words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem in arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Eulerian circuits and minimum de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Generating Necklaces with Fixed Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: De Bruijn Sequences for Fixed-Weight Binary Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set / rank
 
Normal rank
Property / cites work
 
Property / cites work: De Bruijn Sequences for the Binary Strings with Maximum Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Cycles for Weight-Range Binary Strings / rank
 
Normal rank

Revision as of 23:57, 8 July 2024

scientific article
Language Label Description Also known as
English
The lexicographically smallest universal cycle for binary strings with minimum specified weight
scientific article

    Statements

    The lexicographically smallest universal cycle for binary strings with minimum specified weight (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2014
    0 references
    de Bruijn cycle
    0 references
    universal cycle
    0 references
    necklace
    0 references
    FKM algorithm
    0 references
    minimum weight
    0 references

    Identifiers