{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:14:08Z","timestamp":1766578448362},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4595436","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T18:33:52Z","timestamp":1218652432000},"page":"2474-2478","source":"Crossref","is-referenced-by-count":21,"title":["Smooth compression, Gallager bound and nonlinear sparse-graph codes"],"prefix":"10.1109","author":[{"given":"Andrea","family":"Montanari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elchanan","family":"Mossel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","article-title":"detailed network measurements using sparse graph counters: the theory","author":"lu","year":"2007","journal-title":"Proc 45th Allerton Conference"},{"journal-title":"Counter Braids A Novel Counter Architecture for Per-Flow Measurement","year":"2008","author":"dharmapurikar","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.038701"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","author":"cover","year":"1991","journal-title":"Elements of Information Theory"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828064"},{"key":"6","first-page":"224","article-title":"noiseless data compression with low density parity check codes","author":"caire","year":"2004","journal-title":"DIMACS Series in Mathematics and Theoretical Computer Science"},{"journal-title":"Modern Coding Theory draft","year":"0","author":"richardson","key":"5"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gal lager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523592"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/513400.513441"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.2307\/1971117"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2008,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586217\/4594928\/04595436.pdf?arnumber=4595436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T06:06:33Z","timestamp":1557727593000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4595436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4595436","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}