Abstract

This paper proposes a new combinatorial Gray code. Combinatorial Gray code is a method of generating combinatorial objects so that every two successive objects differ as little as possible. Combinatorial object in this paper is a set of words that associated to Puspitodjati’s generating tree of n-length permutations with a given number of cycles. Nodes of the tree is labeled and then coded. The way nodes visited while traversing the tree constructs a new Gray code presented in this paper. The proof that it is a Gray code is given.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.