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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2014.06.003 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6340539 / rank
 
Normal rank
Property / zbMATH Keywords
 
de Bruijn cycle
Property / zbMATH Keywords: de Bruijn cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
universal cycle
Property / zbMATH Keywords: universal cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
necklace
Property / zbMATH Keywords: necklace / rank
 
Normal rank
Property / zbMATH Keywords
 
FKM algorithm
Property / zbMATH Keywords: FKM algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum weight
Property / zbMATH Keywords: minimum weight / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2014.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066342920 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2014.06.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:35, 9 December 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