{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T09:22:48Z","timestamp":1780651368250,"version":"3.54.1"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/tit.2010.2046214","type":"journal-article","created":{"date-parts":[[2010,5,27]],"date-time":"2010-05-27T14:37:19Z","timestamp":1274971039000},"page":"2688-2698","source":"Crossref","is-referenced-by-count":9,"title":["Hash Property and Fixed-Rate Universal Coding Theorems"],"prefix":"10.1109","volume":"56","author":[{"given":"Jun","family":"Muramatsu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shigeki","family":"Miyake","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053719"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903113"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e90-a.9.1830"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.2333"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855604"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.7.2036"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043781"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055356"},{"key":"ref3","article-title":"polynomial complexity universal block decoding with exponential error probability decay","author":"coleman","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"ref6","author":"csiszr","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056524"},{"key":"ref8","first-page":"68","article-title":"lp decoding corrects a constant fraction of errors","author":"feldman","year":"2004","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2005.90"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"ref9","first-page":"460","article-title":"lp decoding achieves capacity","author":"feldman","year":"2005","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5466507\/05466531.pdf?arnumber=5466531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:01:06Z","timestamp":1633914066000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5466531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":18,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2046214","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}