{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:58Z","timestamp":1725489178036},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/allerton.2013.6736619","type":"proceedings-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T22:46:12Z","timestamp":1392331572000},"page":"890-895","source":"Crossref","is-referenced-by-count":4,"title":["Results on the optimal memory-assisted universal compression performance for mixture sources"],"prefix":"10.1109","author":[{"given":"Ahmad","family":"Beirami","sequence":"first","affiliation":[]},{"given":"Mohsen","family":"Sardari","sequence":"additional","affiliation":[]},{"given":"Faramarz","family":"Fekri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.54897"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.782149"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.887856"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195842"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348565"},{"journal-title":"Curing the Amnesia Network Memory for the Internet Tech Report","year":"2009","author":"zhuang","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566774"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089506"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2012.48"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.382017"},{"key":"4","first-page":"1604","article-title":"Results on the redundancy of universal compression for finite-length sequences 2011","author":"beirami","year":"0","journal-title":"IEEE Int Symp on Info Theory (ISIT)"},{"key":"9","first-page":"1087","article-title":"Results on the fundamental gain of memory-assisted universal source coding 2012","author":"beirami","year":"0","journal-title":"IEEE International Symp on Info Theory (ISIT 2012)"},{"key":"8","first-page":"561","article-title":"On lossless universal compression of distributed identical sources 2012","author":"beirami","year":"0","journal-title":"IEEE International Symp on Info Theory (ISIT 2012)"}],"event":{"name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2013,10,2]]},"location":"Monticello, IL","end":{"date-parts":[[2013,10,4]]}},"container-title":["2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6725831\/6736491\/06736619.pdf?arnumber=6736619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T17:27:43Z","timestamp":1490290063000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6736619\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/allerton.2013.6736619","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}