More restrictive Gray codes for necklaces and Lyndon words

Information Processing Letters

Volumn 106, Issue 3, 2008, Pages 96-99

  Vajnovszki, Vincent ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

Combinatorial problems; Gray codes; Lyndon words; Necklaces

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; PROBLEM SOLVING; WORD PROCESSING;

COMBINATORIAL PROBLEMS; GRAY CODES; LYNDON WORDS;

BINARY CODES;

EID: 40149096207     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.10.011     Document Type: Article

References (14)

1. Baril J.L., and Vajnovszki V. Minimal change list for Lucas strings and some graph theoretic consequences. Theoret. Comput. Sci. 346 2-3 (2005) 189-199
2. M.W. Bunder, K.P. Tognetti, G.E. Wheeler, On binary reflected Gray codes and functions, Discrete Math., submitted for publication
3. Cattell K., Ruskey F., Sawada J., Serra M., and Miers C.R. Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2). J. Algorithms 37 2 (2000) 267-282
4. Degni C., and Drisko A.A. Gray-ordered binary necklaces. Electron. J. Combin. 14 (2007) {music sharp sign}R7
5. F. Gray, Pulse code communication. U.S. Patent 2632058, 1953
6. Ruskey F., Savage C., and Wang T. Generating necklaces. J. Algorithms 13 (1992) 414-430
7. Ruskey F., and Sawada J. Generating necklaces and strings with forbidden substrings. 6th Annual International Combinatorics and Computing Conference (COCOON), Sydney, Australia, July 2000. LNCS vol. 1858 (2000), Springer 330-339
8. F. Ruskey, Combinatorial Generation, Book in preparation
9. Sawada J., and Ruskey F. An efficient algorithm for generating necklaces with fixed density. SIAM J. Comput. 29 (1999) 671-684
10. Ueda T. Gray codes for necklaces. Discrete Math. 219 1-3 (2000) 235-248
11. Vajnovszki V. Gray code order for Lyndon words. Discrete Math. Theoret. Comput. Sci. 9 2 (2007) 145-152
12. Walsh T. Generating Gray codes in O (1) worst-case time per word. Proceeding of 4th Conference on Discrete Mathematics and Theoretical Computer Science, Dijon, France, 7-12 July (2003), Springer-Verlag, Berlin 73-78
13. Wang T.M.Y., and Savage C.D. A Gray code for necklaces of fixed density. SIAM J. Discrete Math. 9 4 (1996) 654-673
14. M. Weston, V. Vajnovszki, Gray codes for necklaces and Lyndon words of arbitrary base, Pure Mathematics and Applications/Algebra and Theoretical Computer Science, in press