D. Richards, "Data compression and Gray-code sorting," Inform. Process. Lett., vol. 22, pp. 201--205, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Structure of Single-Track Gray Codes - Schwartz, Etzion (1999) (1 citation) (Correct)
.... moosh, etzion cs. technion.ac.il) Communicated by T. E. Fuja, Associate Editor at Large. Publisher Item Identifier S 0018 9448(99)07312 5. hashing [10] puzzles, such as the Chinese Rings and Tower of Hanoi [13] ordering of documents on shelves [19] signal encoding [20] data compression [22], and circuit testing [23] Finally, for an excellent survey on Gray codes the interested reader is referred to [24] The classic example of a Gray code is the reflected Gray code [14] 15] This code is a list of the binary tuples in the following way. For the list consists of the words and . ....
D. Richards, "Data compression and Gray-code sorting," Inform. Process. Lett., vol. 22, pp. 201--205, 1986.
A Survey of Combinatorial Gray Codes - Savage (1996) (23 citations) (Correct)
.... PR91, Sta92, Wes93] and (7) listing the elements of a Coxeter group so that successive elements differ by a reflection [CSW89] Gray codes have found applications in such diverse areas as circuit testing [RC81] signal encoding [Lud81] ordering of documents on shelves [Los92] data compression [Ric86], statistics [DH94] graphics and image processing [ASD90] processor allocation in the hypercube [CS90] hashing [Fal88] computing the permanent [NW78] information storage and retrieval [CCC92] and puzzles, such as the Chinese Rings and Towers of Hanoi [Gar72] In recent variations on ....
....of binary Gray codes to m ary Gray codes. It was shown in [JWW80] using a generalization of the binary reflected Gray code scheme, that it is always possible to list the Cartesian product of finite sets so that successive elements differ only in one coordinate. A similar result is obtained in [Ric86] where each coordinate i is allowed to assume values in some fixed range 0; N i Gamma 1. Squire generalizes results on clean words to m ary Gray codes [Squ96] but leaves open the case when m is odd. Another listing problem for binary numbers, posed by Doug West, involves a change in the ....
D. Richards. Data compression and Gray-code sorting. Information Processing Letters, 22:210--205, 1986.
A Gray Code for Necklaces of Fixed Density - Wang, Savage (1997) (4 citations) (Correct)
....the binary reflected Gray code [Gra] which is a list of all n bit binary strings in which each string differs from its successor in exactly one bit. By applying the binary Gray code, a variety of problems have been solved and the complexities of the solutions to other problems have been improved [Gar, ChLeDu, ChChCh, Los, Ric]. There are many examples of combinatorial families for which Gray codes are known, including permutations [Joh, Tro] combinations [BuWi, NiWi, Rus1] compositions [Kli] set partitions [Kay] integer partitions [Sav, RaSaWe] binary trees [RuPr, Luc, LuRoRu] and linear extensions [PrRu1, PrRu2, ....
D. Richards, "Data compression and Gray-code sorting," Information Processing Letters 22 (1986) 201-205.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC