{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T19:45:17Z","timestamp":1725392717128},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513281","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"101-105","source":"Crossref","is-referenced-by-count":4,"title":["Asymptotic optimality of antidictionary codes"],"prefix":"10.1109","author":[{"given":"Takahiro","family":"Ota","sequence":"first","affiliation":[]},{"given":"Hiroyoshi","family":"Morita","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"A block-sorting lossless data compression algorithm","author":"burrows","year":"1994","journal-title":"SRC Research Report"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00104-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-01-02933-6"},{"article-title":"Symbolic dynamics and coding","year":"1995","author":"lind","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"article-title":"Probability and Measure","year":"1995","author":"billingsley","key":"ref18"},{"article-title":"Analysis of algorithms","year":"1996","author":"sedgewick","key":"ref19"},{"article-title":"Antidictionary data compression using dynamic suffix trees","year":"2007","author":"ota","key":"ref4"},{"key":"ref3","article-title":"Data compression by arithmetic coding and source modeling based on the anti-dictionary method","author":"ohkawa","year":"2005","journal-title":"IEICE Technical Report IT2005–49"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557208"},{"article-title":"Handbook of data compression","year":"2009","author":"salomon","key":"ref5"},{"key":"ref8","article-title":"Adaptive antidictionary data compression using a set of restricted length of minimal forbidden words","author":"ota","year":"2009","journal-title":"IEICE Technical Report IT2008–99"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895572"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_11"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892711"},{"key":"ref9","first-page":"516","article-title":"DCA using suffix arrays","author":"fiala","year":"2008","journal-title":"Proc of Data Compression Conference (DCC2008)"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513281.pdf?arnumber=5513281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T23:12:54Z","timestamp":1489878774000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513281\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513281","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}