C. C. Chang, H. Y. Chen, and C. Y. Chen, "Symbolic Gray code as a data allocation scheme for two-disc systems," Comput. J., vol. 35, pp. 299--305, 1992. 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)
....Gray codes were shown to exist for which is a power of by Wagner and West [25] Recently, Bhat and Savage [2] have shown that such codes exist for all . During the years Gray codes and their generalizations have found applications in a variety of areas such as information storage and retrieval [4], processor allocation in the hypercube [5] statistics [7] codes for certain memory devices [8] Manuscript received April 20, 1998; revised May 15, 1999. This work was supported by the Fund for the Promotion of Research at the Technion. The authors are with the Computer Science Department, ....
C. C. Chang, H. Y. Chen, and C. Y. Chen, "Symbolic Gray code as a data allocation scheme for two-disc systems," Comput. J., vol. 35, pp. 299--305, 1992.
A Survey of Combinatorial Gray Codes - Savage (1996) (23 citations) (Correct)
.... 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 combinatorial Gray codes, generation problems have been considered in which the difference between successive objects, although fixed, is not required to be small. An example is the problem of listing ....
C. C. Chang, H. Y. Chen, and C. Y. Chen. Symbolic Gray codes as a data allocation scheme for two disc systems. Computer Journal, 35(3):299--305, 1992.
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, ....
C. C. Chang, H. Y. Chen and C. Y. Chen, "Symbolic Gray code as a data allocation scheme for two-disc systems," The Computer Journal 35, 3 (1992) 299305.
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