✦ LIBER ✦

Explicit definition of the binary reflected Gray codes

✍ Scribed by Marston Conder

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 196 KB
Volume: 195
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00188-5

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that for 1 <~j<~n and 1 ~<k ~<2", the jth letter of the kth word of the binary reflected Gray code of length n is equal to the parity of the binomial coefficient 2"-2" ~ iC[2, 2,-~-~-~/21 modulo 2. Also it is shown how this observation and the usual iterative definition of the binary reflected Gray codes are revealed in a modified version of Sierpinski's gasket (Pascal's triangle modulo 2).

📜 SIMILAR VOLUMES

On level-weight studies of binary and m-

On level-weight studies of binary and m-ary gray codes

✍ Bhu Dev Sharma; Ravinder Kumar Khanna 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 378 KB

The complexity of explicit definitions

✍ Harvey Friedman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 625 KB

We begin with a careful statement of what we will call the (X, Y, Z)definability theorem. A relational type is a set X of constant, relation, and function symbols. An X-formula is a formula in the first-order predicate calculus with identity, whose only nonlogical symbols are in X. An X-structure c

An implementation of a high-speed gray-t

An implementation of a high-speed gray-to-binary code converter

✍ Predrag A. Vraneš 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 276 KB

Reconstruction of Binary and Gray-Scale

Reconstruction of Binary and Gray-Scale Images from Mid-crack Code Descriptions

✍ Frank Y. Shih; Wai-Tak Wong 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The chain code is a widely-used description for a contour image. Recently, a mid-crack code algorithm has been proposed as another more precise method for image representation. A simple and fast algorithm for the restoration of binary images based on mid-crack codes description is presented in this

On the definition of binary lieness

✍ A. I. Shirshov 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 132 KB

Gray Codes for the Ideals of Interval Or

Gray Codes for the Ideals of Interval Orders

✍ Michel Habib; Lhouari Nourine; George Steiner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 218 KB

The generation of combinatorial objects in a Gray code manner means that the difference between successive objects is small, e.g., one element for subsets or one transposition for permutations of a set. The existence of such Gray codes is often equivalent to an appropriately defined graph on these o