Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
From MaRDI portal
Publication:4521516
DOI10.1006/jagm.2000.1108zbMath0964.68147OpenAlexW2077583313MaRDI QIDQ4521516
Frank Ruskey, Kevin Cattell, C. Robert Miers, Joe Sawada, Micaela Serra
Publication date: 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1108
Nonnumerical algorithms (68W05) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (20)
One-dimensional cellular automata with random rules: longest temporal period of a periodic solution ⋮ An efficient shift rule for the prefer-max de Bruijn sequence ⋮ The distance to an irreducible polynomial, II ⋮ Finding the largest fixed-density necklace and Lyndon word ⋮ On a symbolic representation of non-central Wishart random matrices with applications ⋮ Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Necklaces and Lyndon words in colexicographic and binary reflected Gray code order ⋮ Boltzmann samplers for \(v\)-balanced cycles ⋮ A Pascal-like bound for the number of necklaces with fixed density ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ A fast algorithm to generate necklaces with fixed content ⋮ \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials ⋮ 3-dimensional necklace flower constellations ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ More restrictive Gray codes for necklaces and Lyndon words ⋮ Inverse Lyndon words and inverse Lyndon factorizations of words ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Investigating the discrepancy property of de Bruijn sequences ⋮ Charm bracelets and their application to the construction of periodic Golay pairs ⋮ Generating fixed density bracelets of arbitrary base
This page was built for publication: Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
