{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:16:05Z","timestamp":1781108165555,"version":"3.54.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/tit.2011.2173244","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T21:19:58Z","timestamp":1328649598000},"page":"585-607","source":"Crossref","is-referenced-by-count":122,"title":["Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds"],"prefix":"10.1109","volume":"58","author":[{"given":"Roxana","family":"Smarandache","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862120"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261727"},{"key":"ref33","article-title":"A new construction for LDPC codes using permutation polynomials over integer rings","author":"takeshita","year":"2005","journal-title":"CoRR"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095211"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018347"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.651076"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2176717"},{"key":"ref36","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc ICSTA 2001"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828093"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365273"},{"key":"ref40","article-title":"Codeword polytopes and linear programming relaxations for error-control coding","author":"wainwright","year":"2005","journal-title":"Workshop on Applications of Statistical Physics to Coding Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref12","author":"massey","year":"1977","journal-title":"Algebraic Topology An Introduction"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1996.0050"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref16","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1184"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"key":"ref28","author":"tanner","year":"1987","journal-title":"Convolutional codes from quasi-cyclic codes A link between the theories of block and convolutional codes"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-1-4613-0165-3_6","author":"mackay","year":"2001","journal-title":"Codes Systems and Graphical Models (Minneapolis MN 1999)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref3","article-title":"Array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc 2nd Int Symp on Turbo Codes and Rel Top"},{"key":"ref6","article-title":"Regular and irregular low-density parity-check codes for iterative decoding based on cycle-invariant difference sets","author":"milenkovic","year":"2003","journal-title":"Proc 41st Allerton Conf on Commun Contr Comput"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/dimacs\/014\/22","article-title":"An algebraic approach to constructing convolutional codes from quasi-cyclic codes","volume":"14","author":"levy","year":"1993","journal-title":"Coding and Quantization"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365314"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00350-4"},{"key":"ref2","first-page":"249","article-title":"On quasi-cyclic repeat-accumulate codes","author":"tanner","year":"1999","journal-title":"Proc 37th Allerton Conf Commun Contr Comput"},{"key":"ref9","volume":"42154","author":"thorpe","year":"2003","journal-title":"Low-Density Parity-Check (LDPC) Codes Constructed from Protographs"},{"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","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.910587"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","volume":"123","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models (Minneapolis MN 1999)"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205910"},{"key":"ref24","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","author":"vontobel","year":"2005","journal-title":"CoRR"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513638"},{"key":"ref23","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 and Rel Top"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899563"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.881361"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2006.12.010"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6145469\/06145509.pdf?arnumber=6145509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:14Z","timestamp":1633909994000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6145509\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":45,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2173244","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}