{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T18:06:33Z","timestamp":1793124393860,"version":"4.5.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"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,4]]},"DOI":"10.1109\/tit.2010.2040961","type":"journal-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T19:51:52Z","timestamp":1269460312000},"page":"1751-1768","source":"Crossref","is-referenced-by-count":245,"title":["Polar Codes are Optimal for Lossy Source Coding"],"prefix":"10.1109","volume":"56","author":[{"given":"Satish Babu","family":"Korada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00fcdiger L.","family":"Urbanke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055108"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523319"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855586"},{"key":"ref37","article-title":"polarization for arbitrary discrete memoryless channels","author":"aolu","year":"2009","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/10\/P10003"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810639"},{"key":"ref34","author":"aldous","year":"0","journal-title":"Reversible Markov Chains and Random Walks on Graphs"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.035105"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.038701"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20090"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523592"},{"key":"ref14","article-title":"binary quantization using belief propagation with decimation over factor graphs of ldgm codes","author":"filler","year":"2007","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595106"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref17","author":"korada","year":"2009","journal-title":"Polar codes for channel and source coding"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920204"},{"key":"ref4","author":"berger","year":"1971","journal-title":"Rate Distortion Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2003.1247033"},{"key":"ref3","author":"goblick","year":"1962","journal-title":"Coding for discrete information source with a distortion measure"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815805"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2001.986929"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055233"},{"key":"ref8","first-page":"100","article-title":"good codes based on very sparse matrices","volume":"1025","author":"mackay","year":"1995","journal-title":"Cryptogr Coding 5th IMA Conf ser Lecture Notes in Comput Sci"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009815"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261737"},{"key":"ref1","first-page":"142","article-title":"coding theorems for a discrete source with a fidelity criterion","volume":"27","author":"shannon","year":"1959","journal-title":"IRE Nat Conv Rec"},{"key":"ref20","article-title":"solving constraint satisfaction problems through belief propagation-guided decimation","author":"montanari","year":"2007","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205860"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref23","first-page":"19","article-title":"coding for channel with random parameters","volume":"9","author":"gelfand","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.808103"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2003.1193994"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5437371\/05437372.pdf?arnumber=5437372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:36:59Z","timestamp":1633916219000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5437372\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":38,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2040961","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4]]}}}