{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T16:54:52Z","timestamp":1725382492570},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006540","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"311-315","source":"Crossref","is-referenced-by-count":3,"title":["Two-dimensional source coding by means of subblock enumeration"],"prefix":"10.1109","author":[{"given":"Takahiro","family":"Ota","sequence":"first","affiliation":[]},{"given":"Hiroyoshi","family":"Morita","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E99.A.2130"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/978-3-662-49529-2_25","article-title":"Linear-time sequence comparison using minimal absent words & applications","author":"crochemore","year":"2016","journal-title":"Proc of 2016 Latin American Symposium on Theoretical Informatics"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6"},{"journal-title":"Information-spectrum methods in information theory","year":"2002","author":"han","key":"ref14"},{"key":"ref4","first-page":"26","article-title":"Improving compression via substring enumeration by explicit phase awareness","author":"dub\u00e9","year":"2014","journal-title":"2014 Data Compression Conference"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033796"},{"key":"ref6","first-page":"73","article-title":"A block-sorting lossless data compression algorithm","author":"burrows","year":"1994","journal-title":"SRC Research Report"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E99.A.601"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620528"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/5.892711"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CCP.2011.32"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2010.28"},{"key":"ref9","first-page":"294","article-title":"On a universal antidictionary coding for stationary ergodic sources with finite alphabet","author":"ota","year":"2014","journal-title":"Proc of the 2014 International Symposium on Information Theory and its Applications"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006540.pdf?arnumber=8006540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T22:19:54Z","timestamp":1570054794000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006540\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006540","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}