A framework for constructing de Bruijn sequences via simple successor rules (Q1783608): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2018.07.010 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2018.07.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2885945836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Combinatorial Algorithm for de Bruijn Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spans of preference functions for de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographically least circular substrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grandmama de Bruijn Sequence for Binary Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-dual sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the generation of full-length shift- register sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of the Ford sequence of length \(2^ n\), n large / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic compositions and de Bruijn sequences / 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: On the cycles and adjacencies in the complementary circulating register / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the generation of binary de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the generation of DeBruijn cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of de Bruijn Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem in arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new memoryless algorithm for de Bruijn sequences / 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 / cites work
 
Property / cites work: A surprisingly simple de Bruijn sequence construction / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2018.07.010 / rank
 
Normal rank

Latest revision as of 11:07, 11 December 2024

scientific article
Language Label Description Also known as
English
A framework for constructing de Bruijn sequences via simple successor rules
scientific article

    Statements

    A framework for constructing de Bruijn sequences via simple successor rules (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 September 2018
    0 references
    cycling register
    0 references
    Bruijn sequence constructions
    0 references

    Identifiers