Publication:2721325
From MaRDI portal
zbMath0979.68046MaRDI QIDQ2721325
No author found.
Publication date: 19 February 2002
68R05: Combinatorics in computer science
05A05: Permutations, words, matrices
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
Prefix partitioned Gray codes for particular cross-bifix-free sets, Gray codes for signed involutions, A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words, Gray code for permutations with a fixed number of cycles, Combinatorial Gray codes for classes of pattern avoiding permutations, Generating restricted classes of involutions, Bell and Stirling permutations, More restrictive Gray codes for some classes of pattern avoiding permutations, A general exhaustive generation algorithm for Gray structures, Gray codes, loopless algorithm and partitions, The coolest way to generate combinations, Gray code for derangements, A loopless algorithm for generating the permutations of a multiset, Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions, Optimal Gray code for involutions