{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:55:08Z","timestamp":1649084108318},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0304-3975(93)90233-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"119-149","source":"Crossref","is-referenced-by-count":0,"title":["Groups of finite elementary codes"],"prefix":"10.1016","volume":"108","author":[{"given":"Masashi","family":"Katsura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Genjiro","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90233-J_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(93)90233-J_BIB2","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/0304-3975(93)90233-J_BIB3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0012-365X(81)80022-2","article-title":"A graph covering construction of all the finite complete biprefix codes","volume":"36","author":"Lallement","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(93)90233-J_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0019-9958(81)90568-4","article-title":"Team tournaments and finite elementary codes","volume":"48","author":"Lallement","year":"1981","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90233-J_BIB5","series-title":"Th\u00e8se Doctorat d'\u00c9tat","article-title":"Bipr\u00e9fixes et Groupes de Permutations","author":"Perrin","year":"1975"},{"key":"10.1016\/0304-3975(93)90233-J_BIB6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.2307\/2318641","article-title":"Some applications of the wreath product construction","volume":"83","author":"Wells","year":"1976","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0304-3975(93)90233-J_BIB7","series-title":"Finite Permutation Groups","author":"Wielandt","year":"1964"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390233J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390233J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:21:23Z","timestamp":1555129283000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390233J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["030439759390233J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90233-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}