{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:23:46Z","timestamp":1648603426030},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/s0012-365x(81)80022-2","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T13:23:51Z","timestamp":1103721831000},"page":"261-271","source":"Crossref","is-referenced-by-count":5,"title":["A graph covering construction of all the finite complete biprefix codes"],"prefix":"10.1016","volume":"36","author":[{"given":"Gerard","family":"Lallement","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(81)80022-2_bib1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01706090","article-title":"Sur un algorithme donnant les codes bipr\u00e9fixes finis","volume":"6","author":"C\u00e9sari","year":"1972","journal-title":"Math. Syst. Th."},{"key":"10.1016\/S0012-365X(81)80022-2_bib2","series-title":"\u201cTh\u00e9orie des Codes\u201d, Actes de la septi\u00e8me Ecole de Printemps d'Informatique Th\u00e9orique","first-page":"29","article-title":"Propri\u00e9t\u00e9s combinatoires des codes bipr\u00e9fixes complets finis","author":"C\u00e9sari","year":"1979"},{"key":"10.1016\/S0012-365X(81)80022-2_bib3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(77)90131-5","article-title":"Generating all graph coverings by permutation voltage assignments","volume":"18","author":"Gross","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(81)80022-2_bib4","unstructured":"G. Lallement and C. Reis, Team tournaments and finite elementary codes, to appear in Information and Control."},{"key":"10.1016\/S0012-365X(81)80022-2_bib5","article-title":"Codes bipr\u00e9fixes et groupes de permutations","author":"Perrin","year":"1975"},{"key":"10.1016\/S0012-365X(81)80022-2_bib6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(79)90026-4","article-title":"La repr\u00e9sentation ergodique d'un automate fini","volume":"9","author":"Perrin","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(81)80022-2_bib7","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1214\/aoms\/1177704860","article-title":"On a special class of recurrent events","volume":"32","author":"Sch\u00fctzenberger","year":"1961","journal-title":"Ann. Math. Stat."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X81800222?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X81800222?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T18:57:04Z","timestamp":1548874624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X81800222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981]]}},"alternative-id":["S0012365X81800222"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(81)80022-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}