Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)

Many applications call for exhaustive lists of strings subject to various constraints, such as inequivalence under group actions. A k-ary necklace is an equivalence class of k-ary strings under rotation (the cyclic group). A k-ary unlabeled necklace is an equivalence class of k-ary strings under rot...

Full description

Bibliographic Details

Published in:	Journal of algorithms Vol. 37; no. 2; pp. 267 - 282
Main Authors:	Cattell, Kevin, Ruskey, Frank, Sawada, Joe, Serra, Micaela, Miers, C.Robert
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.11.2000 Elsevier
Subjects:	Exact sciences and technology Group theory Group theory and generalizations Mathematics Sciences and techniques of general use Necklace (mathematics) Irreducible polynomial Cyclic group Group theory Constant atomized time algorithm Algorithm Tournament
ISSN:	0196-6774, 1090-2678
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!