Loop-Free Gray Code Algorithms for the Set of Compositions

Toufik Mansour; Ghalib Nassar

doi:10.1007/s10852-010-9131-3

Loop-Free Gray Code Algorithms for the Set of Compositions

Toufik Mansour, Ghalib Nassar

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	343-356
Number of pages	14
Journal	Journal of Mathematical Modelling and Algorithms
Volume	9
Issue number	4
DOIs	https://doi.org/10.1007/s10852-010-9131-3
State	Published - Dec 2010

Keywords

Compositions
Gray codes
Loopless algorithms

ASJC Scopus subject areas

Modeling and Simulation
Applied Mathematics

Access to Document

10.1007/s10852-010-9131-3

Cite this

@article{5d3d27ff231b4aad986cce1fbbaaaac8,

title = "Loop-Free Gray Code Algorithms for the Set of Compositions",

abstract = "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.",

keywords = "Compositions, Gray codes, Loopless algorithms",

author = "Toufik Mansour and Ghalib Nassar",

year = "2010",

month = dec,

doi = "10.1007/s10852-010-9131-3",

language = "English",

volume = "9",

pages = "343--356",

journal = "Journal of Mathematical Modelling and Algorithms",

issn = "1570-1166",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - Loop-Free Gray Code Algorithms for the Set of Compositions

AU - Mansour, Toufik

AU - Nassar, Ghalib

PY - 2010/12

Y1 - 2010/12

N2 - 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.

AB - 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.

KW - Compositions

KW - Gray codes

KW - Loopless algorithms

UR - https://www.scopus.com/pages/publications/78349310646

U2 - 10.1007/s10852-010-9131-3

DO - 10.1007/s10852-010-9131-3

M3 - Article

AN - SCOPUS:78349310646

SN - 1570-1166

VL - 9

SP - 343

EP - 356

JO - Journal of Mathematical Modelling and Algorithms

JF - Journal of Mathematical Modelling and Algorithms

IS - 4

ER -

Loop-Free Gray Code Algorithms for the Set of Compositions

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this