{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T06:25:29Z","timestamp":1746858329275},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205910","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"229-233","source":"Crossref","is-referenced-by-count":14,"title":["Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties"],"prefix":"10.1109","author":[{"given":"Roxana","family":"Smarandache","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/05\/P05003"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917682"},{"journal-title":"Kalman filters factor graphs and electrical networks","year":"2002","author":"vontobel","key":"11"},{"key":"12","article-title":"factor graphs, electrical networks, and entropy","author":"vontobel","year":"2002","journal-title":"Proc 40th Allerton Conf on Communication Control and Computing"},{"key":"3","article-title":"quasi-cyclic ldpc codes: influence of proto- and tannergraph structure on minimum hamming distance upper bounds","author":"smarandache","year":"2009","journal-title":"submitted to IEEE Trans Inf Theory available online under"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365314"},{"year":"0","key":"1"},{"journal-title":"Mathematical Programming and Electrical Networks","year":"1959","author":"dennis","key":"10"},{"key":"7","article-title":"graph-cover decoding and finitelength analysis of message-passing iterative decoding of ldpc codes","author":"vontobel","year":"0","journal-title":"accepted for IEEE Trans Inform Theory available online under"},{"key":"6","first-page":"75","article-title":"graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 2nd Int Symp Turbo Codes &amp Related Topics"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"article-title":"decoding error-correcting codes via linear programming","year":"2003","author":"feldman","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2006.12.010"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205910.pdf?arnumber=5205910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T19:59:52Z","timestamp":1489780792000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205910\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205910","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}