{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:30:16Z","timestamp":1754152216829,"version":"3.41.2"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1983,11]]},"DOI":"10.1109\/tit.1983.1056755","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"894-901","source":"Crossref","is-referenced-by-count":3,"title":["Statistical estimates of then-bit Gray codes by restricted random generation of permutations of 1 to2^n"],"prefix":"10.1109","volume":"29","author":[{"given":"J.","family":"Silverman","sequence":"first","affiliation":[]},{"given":"V.","family":"Vickers","sequence":"additional","affiliation":[]},{"given":"J.","family":"Sampson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675573"},{"key":"ref3","first-page":"31","article-title":"Some run orders requiring a minimum number of factor level changes for the 2<superscript>4<\/superscript> and 2<superscript>5<\/superscript> main effect plans","volume":"16","author":"dickinson","year":"1974","journal-title":"Technometrics"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90143-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/el:19750416"},{"key":"ref11","first-page":"224","article-title":"Twenty odd questions in combinatorics","author":"moser","year":"1970","journal-title":"Proc 2nd Chapel Hill Conf Comb Math Appl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(81)90027-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0872-106"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094886"},{"journal-title":"Pulse code communication","year":"0","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1958.tb03887.x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0872-76"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22735\/01056755.pdf?arnumber=1056755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:40Z","timestamp":1753121260000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056755\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":11,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056755","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}