{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T04:34:40Z","timestamp":1685162080305},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,11,1]],"date-time":"2007-11-01T00:00:00Z","timestamp":1193875200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2007,11]]},"DOI":"10.1007\/s11390-007-9094-7","type":"journal-article","created":{"date-parts":[[2007,11,17]],"date-time":"2007-11-17T03:02:53Z","timestamp":1195268573000},"page":"909-913","source":"Crossref","is-referenced-by-count":3,"title":["Generating Combinations by Three Basic Operations"],"prefix":"10.1007","volume":"22","author":[{"given":"Yongxi","family":"Cheng","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,17]]},"reference":[{"key":"9094_CR1","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1002\/j.1538-7305.1958.tb03887.x","volume":"37","author":"E N Gilbert","year":"1958","unstructured":"Gilbert E N. Gray codes and paths on the n-cube. Bell Systems Technical Journal, 1958, 37: 815\u2013826.","journal-title":"Bell Systems Technical Journal"},{"key":"9094_CR2","unstructured":"Gray F. Pulse code communication. U.S. Patent Number 2632058, 1953."},{"issue":"1","key":"9094_CR3","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1137\/0209013","volume":"9","author":"J T Joichi","year":"1980","unstructured":"Joichi J T, White D E, Willamson S G. Combinatorial Gray Codes. SIAM Journal on Computing, 1980, 9(1): 130\u2013141.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"9094_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(86)90029-3","volume":"22","author":"D Richards","year":"1986","unstructured":"Richards D. Data compression and Gray-code sorting. Information Processing Letters, 1986, 22(4): 201\u2013205.","journal-title":"Information Processing Letters"},{"issue":"4","key":"9094_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00156752","volume":"4","author":"P Diaconis","year":"1994","unstructured":"Diaconis P, Holmes S. Gray codes for randomization procedures. Statistics and Computing, 1994, 4(4): 287\u2013302.","journal-title":"Statistics and Computing"},{"key":"9094_CR6","doi-asserted-by":"crossref","unstructured":"Amalraj D J, Sundararajan N, Dhar G. A data structure based on Gray code encoding for graphics and image processing. In Proc. the SPIE: International Society for Optical Engineering, Hague, Netherlands, 1990, pp.65\u201376.","DOI":"10.1117\/12.23516"},{"issue":"9","key":"9094_CR7","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/12.57056","volume":"C-39","author":"M Chen","year":"1990","unstructured":"Chen M, Shin K. Subcube allocation and task migration in hypercube multiprocessors. IEEE Transactions on Computers, 1990, C-39(9): 1146\u20131155.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"9094_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/comjnl\/35.3.299","volume":"35","author":"C C Chang","year":"1992","unstructured":"Chang C C, Chen H Y, Chen C Y. Symbolic gray code as a data allocation scheme for two-disc systems. Computer Journal, 1992, 35(3): 299\u2013305.","journal-title":"Computer Journal"},{"issue":"4","key":"9094_CR9","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage C. A survey of combinatorial gray codes. SIAM Review, 1997, 39(4): 605\u2013629.","journal-title":"SIAM Review"},{"key":"9094_CR10","first-page":"570","volume-title":"Proc. 11th Annual International Computing and Combinatorics Conference (COCOON'2005), LNCS 3595","author":"F Ruskey","year":"2005","unstructured":"Ruskey F, Williams A. Generating combinations by prefix shifts. In Proc. 11th Annual International Computing and Combinatorics Conference (COCOON'2005), LNCS 3595, Kunming, China, Springer, 2005, pp.570\u2013576."},{"issue":"2","key":"9094_CR11","first-page":"176","volume":"C-22","author":"D T Tang","year":"1973","unstructured":"Tang D T, Liu C N. Distance-2 cycle chaining of constant weight codes. IEEE Transactions, 1973, C-22(2): 176\u2013180.","journal-title":"IEEE Transactions"},{"issue":"3","key":"9094_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","volume":"19","author":"P Eades","year":"1984","unstructured":"Eades P, McKay B. An algorithm for generating subsets of fixed size with a strong minimal change property. Information Processing Letters, 1984, 19(3): 131\u2013133.","journal-title":"Information Processing Letters"},{"key":"9094_CR13","first-page":"215","volume":"69","author":"P J Chase","year":"1989","unstructured":"Chase P J. Combination generation and Graylex ordering. Congressus Numerantium, 1989, 69: 215\u2013242.","journal-title":"Congressus Numerantium"},{"key":"9094_CR14","unstructured":"Knuth D E. Pre-fascicle 4A (a draft of Section 7.2.1.3: Generating all Combinations). The Art of Computer Programming. Addison-Wesley, 2004, 61 pages, http:\/\/www-cs-faculty.stanford.edu\/~knuth\/fasc3a.ps.gz"},{"issue":"3","key":"9094_CR15","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G Ehrlich","year":"1973","unstructured":"Ehrlich G. Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. Journal of the ACM, 1973, 20(3): 500\u2013513.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9094_CR16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1090\/S0002-9947-99-02229-1","volume":"351","author":"T Chinburg","year":"1999","unstructured":"Chinburg T, Savage C D, Wilf H S. Combinatorial families that are exponentially far from being listable in Gray code sequence. Transactions of the American Mathematical Society, 1999, 351(1): 379\u2013402.","journal-title":"Transactions of the American Mathematical Society"},{"issue":"3\u20134","key":"9094_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1080\/03081089308818261","volume":"35","author":"R C Compton","year":"1993","unstructured":"Compton R C, Williamson S G. Doubly adjacent Gray codes for the symmetric group: How to braid n strands. Linear and Multilinear Algebra, 1993, 35(3\u20134): 237\u2013293.","journal-title":"Linear and Multilinear Algebra"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9094-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9094-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9094-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:39Z","timestamp":1559399559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9094-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["9094"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9094-7","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11]]}}}