Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields

DOI10.1007/978-3-662-43948-7_60zbMath1373.11079arXiv1504.00572OpenAlexW3184185275MaRDI QIDQ5167786

Swastik Kopparty, Mrinal Kumar, Michael E. Saks

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00572

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorics on words (68R15) Cryptography (94A60) Polynomials over finite fields (11T06)

Related Items (3)

Matrix rigidity of random Toeplitz matrices ⋮ Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence

This page was built for publication: Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields