{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:47:25Z","timestamp":1648972045905},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National Science Foundation","award":["DMS-0901693"],"award-info":[{"award-number":["DMS-0901693"]}]},{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"crossref","award":["H-98230-06-1-0008"],"award-info":[{"award-number":["H-98230-06-1-0008"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/tit.2014.2331677","type":"journal-article","created":{"date-parts":[[2014,6,23]],"date-time":"2014-06-23T19:50:14Z","timestamp":1403553014000},"page":"5215-5227","source":"Crossref","is-referenced-by-count":0,"title":["Pseudocodewords of Parity-Check Codes Over Fields of Prime Cardinality"],"prefix":"10.1109","volume":"60","author":[{"given":"Wittawat","family":"Kositwattanarerk","sequence":"first","affiliation":[]},{"given":"Gretchen L.","family":"Matthews","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"fukuda","year":"2008","journal-title":"CDD and CDD+ Homepage"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-61576-8_77","article-title":"Double description method revisited","volume":"1120","author":"fukuda","year":"1996","journal-title":"Proc 4th Franco-Chinese Conf Combinat Comput Sci"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2211859"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442864"},{"key":"ref14","author":"hemmecke","year":"2013","journal-title":"4ti2 - a software package for algebraic geometric and combinatorial problems on linear spaces"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262072"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2006.12.010"},{"key":"ref18","first-page":"75","article-title":"Graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Int Symp on Turbo Codes & Related Topics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095071"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITW2.2006.323767"},{"key":"ref4","first-page":"368","article-title":"Über systeme von linear-homogenen Gleichungen und Ungleichungen","volume":"34","author":"van der corput","year":"1931","journal-title":"Konink Akad Wetensch Amsterdam Proc"},{"key":"ref27","article-title":"Codes and decoding on general graphs","author":"wiberg","year":"1996"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557442"},{"key":"ref6","article-title":"Decoding error-correcting codes via linear programming","author":"feldman","year":"2003"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557412"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025571"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162224"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.720542"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025529"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref22","first-page":"1","article-title":"Characterization of graph-cover pseudocodewords of codes over F3","author":"skachek","year":"2010","journal-title":"Proc IEEE Inform Theory Workshop"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.070213.120801"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595239"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658737"},{"key":"ref26","author":"vontobel","year":"2005","journal-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes CoRR"},{"key":"ref25","article-title":"Lower bounds on the minimum pseudoweight of linear codes","author":"vontobel","year":"2004","journal-title":"Proc IEEE Int Symp Inform Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6878505\/06841613.pdf?arnumber=6841613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:50:27Z","timestamp":1642006227000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6841613\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":29,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2331677","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}