{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:42:18Z","timestamp":1729654938656,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205727","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"537-540","source":"Crossref","is-referenced-by-count":5,"title":["Length of minimal forbidden words on a stationary ergodic source"],"prefix":"10.1109","author":[{"given":"Takahiro","family":"Ota","sequence":"first","affiliation":[]},{"given":"Hiroyoshi","family":"Morita","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69068-9_12"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205727"},{"key":"17","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 International Conference on the Analysis ofAlgorithms (AofA'05)"},{"article-title":"compression de donnees sans perte et combinatoire analytique","year":"2006","author":"fayolle","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00104-5"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e90-a.11.2533"},{"year":"0","key":"13"},{"key":"14","first-page":"12","article-title":"on construction of reversible variable-length codes including resynchronization markers as codewords","author":"sun","year":"2006","journal-title":"Proc of 2006 Int'I Symp on Information Theory and its Applications (ISITA2006)"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.03.006"},{"key":"12","article-title":"branch prediction based on antidictionary tree","author":"nishiara","year":"0","journal-title":"IEICE technical report"},{"year":"0","key":"21"},{"key":"3","article-title":"data compression by arithmetic coding and source modeling based on the anti-dictionary method","author":"ohkawa","year":"0","journal-title":"IEICE technical report"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/18.45281"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_11"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892711"},{"key":"10","article-title":"a block-sorting lossless data compression algorithm","author":"burrows","year":"1994","journal-title":"SRC Research Report"},{"key":"7","first-page":"1187","article-title":"one-pass ecg lossless compression using antidictionaries","volume":"j87 a","author":"ota","year":"2004","journal-title":"IEICE Trans Fundamentals"},{"key":"6","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1109\/DCC.2008.95","article-title":"dca using suffix arrays","author":"fiala","year":"2008","journal-title":"Proc Data Compression Conference"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895572"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557208"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6"},{"key":"8","article-title":"on-line electrocardiogram lossless compression using antidictionary-based methods","author":"ota","year":"2009","journal-title":"Third Int'I Symp on Medical Information & Communication Technology (ISMICT2009)"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205727.pdf?arnumber=5205727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:35:57Z","timestamp":1558485357000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205727\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205727","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}