{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T19:44:06Z","timestamp":1725392646848},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513618","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"759-763","source":"Crossref","is-referenced-by-count":0,"title":["On the pseudocodeword redundancy"],"prefix":"10.1109","author":[{"given":"Jens","family":"Zumbragel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark F.","family":"Flanagan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"67","article-title":"Lower bounds on the minimum pseudoweight of linear codes","author":"vontobel","year":"2004","journal-title":"Proc IEEE International Symposium on Information Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899563"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1992.6780893"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1978","author":"macwilliams","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313040"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924700"},{"key":"ref5","article-title":"Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes","author":"vontobel","year":"2005","journal-title":"IEEE Trans Inform Theory Arxiv report arXiv cs IT\/0512078"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828066"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref1","first-page":"101","article-title":"On the effective weights of pseudocodewords for codes defined on graphs with cycles","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models IMA workshop Minneapolis USA Aug 1999"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228136"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513618.pdf?arnumber=5513618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T20:24:35Z","timestamp":1489868675000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513618\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513618","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}