Combinatorial Gray Codes

DOI10.1137/0209013MaRDI QIDQ3898504zbMATH OpenOpenAlexFDO

Authors J. T. Joichi, Dennis White, S. Gill Williamson

Publication date 1980

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0209013

zbMATH Keywords

combinatorial Gray codescombinatorial objectslinear ordersloop free algorithmsrecursionuniformly bounded transition algorithms

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Linear codes (general theory) (94B05)

Cited in

(18)

• Gray-Codes
• Gray codes in graphs of subsets
• Gray codes from antimatroids
• Weak-order extensions of an order.
• Gray codes for reflection groups
• A loop-free algorithm for generating the linear extensions of a poset
• Restricted compositions and permutations: from old to new Gray codes
• Variable-length codes independent or closed with respect to edit relations
• Gray cycles of maximum length related to \(k\)-character substitutions
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
• Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes
• Combinatorial isomorphism between Fibonacci classes
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• On the maximum disjoint paths problem on edge-colored graphs
• Space-optimal quasi-Gray codes with logarithmic read complexity
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
• Algorithm 1059: LinCodeWeightInv -- library for computing the weight distribution of linear codes over finite fields
• Gray code orders for \(q\)-ary words avoiding a given factor

This page was built for publication: Combinatorial Gray Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898504)