{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:34:20Z","timestamp":1729636460598,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/isit.2007.4557442","type":"proceedings-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T04:17:12Z","timestamp":1215577032000},"page":"1546-1550","source":"Crossref","is-referenced-by-count":25,"title":["Pseudo-codeword Landscape"],"prefix":"10.1109","author":[{"given":"Michael","family":"Chertkov","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Stepanov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"relationship between LP decoding and Min-Sum Algorithms Decoding","author":"vontobel","year":"2004","journal-title":"ISITA"},{"article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","year":"0","author":"vontobel","key":"ref11"},{"key":"ref12","article-title":"An Efficient Pseudo-Codeword-Search Algorithm for Linear Programming Decoding of LDPC Codes","author":"chertkov","year":"0","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref13","article-title":"Loop Calculus Helps to Improve Belief Propagation and Linear Programming Decodings of Low-Density-Parity-Check Codes","author":"chertkov","year":"2006","journal-title":"44th Allerton Conference"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262071"},{"key":"ref15","article-title":"Towards Low-Complexity Linear-Programming Decoding","author":"vontobel","year":"2006","journal-title":"International Symposium on Turbo Codes and Related Topics"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.95.228701","article-title":"Diagnosis of weak-ness in error correction codes:a physics approach to error floor analysis","volume":"95","author":"stepanov","year":"2005","journal-title":"Phys Rev Lett"},{"journal-title":"Codes and decoding on general graphs","year":"1996","author":"wiberg","key":"ref18"},{"key":"ref19","article-title":"Error floors of LDPC codes","author":"richardson","year":"0","journal-title":"Proceeding of Allerton Conference 2003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"journal-title":"Advanced Error Control Techniques for Data Storage Systems","year":"2005","author":"kurtas","key":"ref6"},{"journal-title":"IEEE P802 1ln\/Dl","article-title":"Wireless LAN Medium Access Control (MAC) and Physical Layer (pHY) specifications - Enhancements for Higher Throughput (Draft)","year":"2006","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref9","first-page":"75","article-title":"Graph covers and iterative decoding of finite-codes","author":"koetter","year":"2003","journal-title":"Proc 3rd International Symposium on Turbo Codes & Related Topics"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0165-3_5"},{"key":"ref22","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc of ISCTA"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1995.550455"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1007\/BF02579283","article-title":"Explicit construction of graphs without short circles and low-density codes","volume":"2","author":"margulis","year":"1982","journal-title":"COMBINATORICA"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261777"}],"event":{"name":"2007 IEEE International Symposium on Information Theory","start":{"date-parts":[[2007,6,24]]},"location":"Nice","end":{"date-parts":[[2007,6,29]]}},"container-title":["2007 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4497218\/4557062\/04557442.pdf?arnumber=4557442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T15:12:49Z","timestamp":1557673969000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4557442\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit.2007.4557442","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}