Loop-Free Gray Code Algorithms for the Set of Compositions

Toufik Mansour, Ghalib Nassar

Research output: Contribution to journalArticlepeer-review


The topic of Gray codes for the set of compositions with non-negative integer parts has been studied by several authors. Klingsberg gave a non-recursive description of a Gray code for this set after the recursive version of Knuth. Recently, Walsh modified Klingsberg's algorithm to find a Gray code which generates the set of all bounded compositions with non-negative integer parts. In this paper, we present two loopless Gray code algorithms for the set of compositions with positive integer parts.

Original languageEnglish
Pages (from-to)343-356
Number of pages14
JournalJournal of Mathematical Modelling and Algorithms
Issue number4
StatePublished - Dec 2010


  • Compositions
  • Gray codes
  • Loopless algorithms

ASJC Scopus subject areas

  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Loop-Free Gray Code Algorithms for the Set of Compositions'. Together they form a unique fingerprint.

Cite this