{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T07:21:49Z","timestamp":1725434509328},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874996","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"1066-1070","source":"Crossref","is-referenced-by-count":0,"title":["Correction of samplable additive errors"],"prefix":"10.1109","author":[{"given":"Kenji","family":"Yasunaga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.20"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2004.1313782"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892063"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-005-0198-6"},{"key":"13","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/3-540-57785-8_183","article-title":"A new approach to information theory","author":"lipton","year":"1994","journal-title":"STACS"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2070370"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911217"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205931"},{"key":"2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1090\/dimacs\/066\/16","article-title":"Noiseless data compression with low density parity check codes","author":"caire","year":"2004","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030308"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/0220034"},{"key":"6","first-page":"556","article-title":"Entropic security and the encryption of high entropy messages","author":"dodis","year":"2005","journal-title":"TCC"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_35"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/2141938.2141941"},{"key":"9","article-title":"Optimal-rate code constructions for computationally simple channels","author":"guruswami","year":"2013","journal-title":"CoRR"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.74"}],"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\/06874996.pdf?arnumber=6874996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:22:47Z","timestamp":1602674567000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874996","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}