{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:14:14Z","timestamp":1729664054182,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/isit.2007.4557208","type":"proceedings-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T04:17:12Z","timestamp":1215577032000},"page":"86-90","source":"Crossref","is-referenced-by-count":7,"title":["On the On-line Arithmetic Coding Based on Antidictionaries with Linear Complexity"],"prefix":"10.1109","author":[{"given":"Takahiro","family":"Ota","sequence":"first","affiliation":[]},{"given":"Hiroyoshi","family":"Morita","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"135","article-title":"Data compression using source model based on antidictionary tree","volume":"105","author":"ota","year":"2006","journal-title":"IEICE technical report"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"ref12","first-page":"393","article-title":"A tight upper bound on the size of the antidictionary of a binary string","author":"morita","year":"2005","journal-title":"Proc 2005 Int'l Conf on the Analysis of Algorithms (AofA'05)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00436-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6"},{"journal-title":"Calgary text compression corpus","year":"0","key":"ref17"},{"key":"ref18","article-title":"Arithmetic coding","author":"morita","year":"2002","journal-title":"Source coding Society of Information Theory and its Applications Baifukan"},{"year":"2002","author":"gailly","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00104-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.03.006"},{"key":"ref6","first-page":"37","article-title":"Data compression using antidictionary for finite-alphabet sources","volume":"106","author":"ota","year":"2006","journal-title":"IEICE technical report"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262007"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-540-27801-6_11","article-title":"A Trie-Based Approach for Compacting Automata","volume":"3109","author":"crochemore","year":"2004","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref2","first-page":"1187","article-title":"One-pass ECG lossless compression using antidictionaries","volume":"j87 a","author":"ota","year":"2004","journal-title":"IEICE Trans Fundamentals (Japanese Edition)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892711"},{"key":"ref9","first-page":"41","article-title":"Data compression by arithmetic coding and source modeling based on the anti-dictionary method","volume":"105","author":"ohkawa","year":"2005","journal-title":"IEICE technical report"}],"event":{"name":"2007 IEEE International Symposium on Information Theory","start":{"date-parts":[[2007,6,24]]},"location":"Nice","end":{"date-parts":[[2007,6,29]]}},"container-title":["2007 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4497218\/4557062\/04557208.pdf?arnumber=4557208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T09:45:39Z","timestamp":1497779139000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4557208\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2007.4557208","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}