{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T15:15:08Z","timestamp":1773846908673,"version":"3.50.1"},"reference-count":17,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2009,2]]},"abstract":"<jats:p>We study computably enumerable (c.e.) prefix codes that are capable of coding all positive integers in an optimal way up to a fixed constant: these codes will be called universal. We prove various characterisations of these codes, including the following one: a c.e. prefix code is universal if and only if it contains the domain of a universal self-delimiting Turing machine. Finally, we study various properties of these codes from the points of view of computability, maximality and density.<\/jats:p>","DOI":"10.1017\/s0960129508007238","type":"journal-article","created":{"date-parts":[[2009,2,20]],"date-time":"2009-02-20T20:49:19Z","timestamp":1235162959000},"page":"45-57","source":"Crossref","is-referenced-by-count":7,"title":["On universal computably enumerable prefix codes"],"prefix":"10.1017","volume":"19","author":[{"given":"CRISTIAN S.","family":"CALUDE","sequence":"first","affiliation":[]},{"given":"LUDWIG","family":"STAIGER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,2,1]]},"reference":[{"key":"S0960129508007238_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_3"},{"key":"S0960129508007238_ref11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"S0960129508007238_ref7","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham","year":"1989"},{"key":"S0960129508007238_ref15","first-page":"1","article-title":"Good lower and upper bounds on binomial coefficients","volume":"2","author":"St\u0103nic\u0103","year":"2001","journal-title":"J. Ineq. in Pure and Appl. Math."},{"key":"S0960129508007238_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.07.003"},{"key":"S0960129508007238_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3"},{"key":"S0960129508007238_ref2","volume-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"S0960129508007238_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(70)90105-1"},{"key":"S0960129508007238_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608858"},{"key":"S0960129508007238_ref9","first-page":"173","article-title":"The redundancy and delay of decodable coding of natural numbers","volume":"20","author":"Leven\u0161te\u012dn","year":"1968","journal-title":"Problemy Kibernet"},{"key":"S0960129508007238_ref12","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1017"},{"key":"S0960129508007238_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04978-5"},{"key":"S0960129508007238_ref13","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2005032"},{"key":"S0960129508007238_ref14","first-page":"205","article-title":"On maximal prefix codes","volume":"91","author":"Staiger","year":"2007","journal-title":"Bull. EATCS"},{"key":"S0960129508007238_ref16","doi-asserted-by":"publisher","DOI":"10.14492\/hokmj\/1350911778"},{"key":"S0960129508007238_ref17","doi-asserted-by":"publisher","DOI":"10.1070\/RM1970v025n06ABEH001269"},{"key":"S0960129508007238_ref10","unstructured":"Nies A. (2007) Personal communication."}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129508007238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T20:19:31Z","timestamp":1554322771000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129508007238\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["S0960129508007238"],"URL":"https:\/\/doi.org\/10.1017\/s0960129508007238","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}