{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T09:49:31Z","timestamp":1725443371101},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875156","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"1862-1866","source":"Crossref","is-referenced-by-count":3,"title":["A parallel two-pass MDL context tree algorithm for universal source coding"],"prefix":"10.1109","author":[{"given":"Nikhil","family":"Krishnan","sequence":"first","affiliation":[]},{"given":"Dror","family":"Baron","sequence":"additional","affiliation":[]},{"given":"Mehmet Kivanc","family":"Mihcak","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Fast parallel algorithms for universal lossless source coding","year":"2003","author":"baron","key":"15"},{"key":"16","article-title":"Two-part codes with low worst-case redundancies for distributed compression of Bernoulli sequences","author":"baron","year":"2003","journal-title":"Proc Conf Systems Sciences"},{"key":"13","first-page":"3","article-title":"A study of the context tree maximizing method","author":"volf","year":"1995","journal-title":"Proc 17th Symp on Inform Theory in the Benelux"},{"key":"14","first-page":"7","article-title":"Contexttree maximizing","author":"willems","year":"2000","journal-title":"Proc Conf Inf Sci Syst"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.481776"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826664"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284253"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1996.488325"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS.2010.5491817"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.312161"},{"key":"7","first-page":"245","article-title":"Some challenges in source coding","author":"willems","year":"2000","journal-title":"Proc 3rd ITG Conf Source Channel Coding"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"4","first-page":"85","article-title":"A parallel implementation of the CTW compression algorithm","author":"stassen","year":"2001","journal-title":"Proc 22d Benelux Symp Inf Comm"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875156.pdf?arnumber=6875156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:22:29Z","timestamp":1602688949000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875156","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}