Pages that link to "Item:Q4521516"

The following pages link to Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) (Q4521516):

Displayed 16 items.

• Boltzmann samplers for \(v\)-balanced cycles (Q391394) ‎ (← links)
• The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) ‎ (← links)
• 3-dimensional necklace flower constellations (Q680982) ‎ (← links)
• More restrictive Gray codes for necklaces and Lyndon words (Q963341) ‎ (← links)
• A fast algorithm to generate necklaces with fixed content (Q1400003) ‎ (← links)
• An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) ‎ (← links)
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) ‎ (← links)
• \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials (Q1693363) ‎ (← links)
• Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) ‎ (← links)
• Charm bracelets and their application to the construction of periodic Golay pairs (Q2345628) ‎ (← links)
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) ‎ (← links)
• Finding the largest fixed-density necklace and Lyndon word (Q2628279) ‎ (← links)
• On a symbolic representation of non-central Wishart random matrices with applications (Q2637606) ‎ (← links)
• Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) ‎ (← links)
• Generating fixed density bracelets of arbitrary base (Q2875290) ‎ (← links)
• The distance to an irreducible polynomial, II (Q2894521) ‎ (← links)