Loop-free Gray code algorithms for the set of compositions

DOI10.1007/s10852-010-9131-3zbMath1248.94122MaRDI QIDQ655198

Toufik Mansour, Ghalib Nassar

Publication date: 2 January 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-010-9131-3

zbMATH Keywords

loopless algorithm; composition; Gray code

Mathematics Subject Classification ID

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

94B25: Combinatorial codes

Related Items

Generalized algorithm for restricted weak composition generation, Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions, Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the loopless generation of binary tree sequences
• Gray codes, loopless algorithm and partitions
• Generating permutations with given ups and downs
• Generating permutations of a bag by interchanges
• Gray code for derangements
• A loopless algorithm for generating the permutations of a multiset
• A Gray code for compositions
• Generating Multiset Permutations in Constant Time
• Loopless Generation of Trees with Specified Degrees
• Combinatorics of Compositions and Words
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Generation of Permutations by Adjacent Transposition