{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:58:17Z","timestamp":1743051497239,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319586304"},{"type":"electronic","value":"9783319586311"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58631-1_6","type":"book-chapter","created":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T02:26:03Z","timestamp":1493951163000},"page":"68-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Canonical Form of Gray Codes in N-cubes"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Contassot-Vivier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Couchot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,6]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1134\/S1990478916010099","volume":"10","author":"IS Bykov","year":"2016","unstructured":"Bykov, I.S.: On locally balanced gray codes. J. Appl. Ind. Math. 10(1), 78\u201385 (2016). http:\/\/dx.doi.org\/10.1134\/S1990478916010099","journal-title":"J. Appl. Ind. Math."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Cao, L., Min, L., Zang, H.: A chaos-based pseudorandom number generator and performance analysis. In: International Conference on Computational Intelligence and Security, CIS 2009, vol. 1, pp. 494\u2013498. IEEE, December 2009","DOI":"10.1109\/CIS.2009.203"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Couchot, J.F., Contassot-Vivier, S., H\u00e9am, P.C., Guyeux, C.: Random walk in a N-cube without Hamiltonian cycle to chaotic pseudorandom number generation: theoretical and practical considerations. International Journal of Bifurcation and Chaos (2016). Accepted on October 2016","DOI":"10.1142\/S0218127417500146"},{"key":"6_CR4","unstructured":"Couchot, J., H\u00e9am, P., Guyeux, C., Wang, Q., Bahi, J.M.: Pseudorandom number generators with balanced gray codes. In: SECRYPT 2014 - Proceedings of the 11th International Conference on Security and Cryptography, Vienna, Austria, 28\u201330 August 2014, pp. 469\u2013475 (2014)"},{"key":"6_CR5","unstructured":"Sloane, N.: On-line encyclopedia of integer sequences. http:\/\/oeis.org"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/81.915385","volume":"48","author":"T Stojanovski","year":"2001","unstructured":"Stojanovski, T., Kocarev, L.: Chaos-based random number generators-part i: analysis [cryptography]. IEEE Trans. Circ. Syst. I: Fundam. Theor. Appl. 48(3), 281\u2013288 (2001)","journal-title":"IEEE Trans. Circ. Syst. I: Fundam. Theor. Appl."},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/81.915396","volume":"48","author":"T Stojanovski","year":"2001","unstructured":"Stojanovski, T., Pihl, J., Kocarev, L.: Chaos-based random number generators part ii: practical realization. IEEE Trans. Circ. Syst. I: Fundam. Theor. Appl. 48(3), 382\u2013385 (2001)","journal-title":"IEEE Trans. Circ. Syst. I: Fundam. Theor. Appl."},{"issue":"4","key":"6_CR8","first-page":"81","volume":"11","author":"I Suparta","year":"2004","unstructured":"Suparta, I., van Zanten, A.: Totally balanced and exponentially balanced gray codes. Discrete Anal. Oper. Res. (Russia) 11(4), 81\u201398 (2004)","journal-title":"Discrete Anal. Oper. Res. (Russia)"},{"issue":"18","key":"6_CR9","doi-asserted-by":"publisher","first-page":"4124","DOI":"10.1016\/j.disc.2007.07.116","volume":"308","author":"I Suparta","year":"2008","unstructured":"Suparta, I., van Zanten, A.: A construction of gray codes inducing complete graphs. Discrete Math. 308(18), 4124\u20134132 (2008)","journal-title":"Discrete Math."},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jda.2007.01.005","volume":"6","author":"M Wild","year":"2008","unstructured":"Wild, M.: Generating all cycles, Chordless cycles, and Hamiltonian cycles with the principle of exclusion. J. Discrete Algorithms 6(1), 93\u2013103 (2008). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1570866707000020, Selected papers from AWOCA 2005 Sixteenth Australasian Workshop on Combinatorial Algorithms","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58631-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:02:47Z","timestamp":1621814567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58631-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319586304","9783319586311"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58631-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"6 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AUTOMATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Cellular Automata and Discrete Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/automata2017.disco.unimib.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}