{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T17:20:45Z","timestamp":1725384045830},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523757","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"2295-2299","source":"Crossref","is-referenced-by-count":1,"title":["High-rate quasi-cyclic low-density parity-check codes derived from finite affine planes"],"prefix":"10.1109","author":[{"given":"N.","family":"Kamiya","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"The Proc Int Symp Communications Theory and Applications"},{"journal-title":"Majority decodable codes derived from finite geometries","year":"1967","author":"smith","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"15","article-title":"Evaluation of Gallager codes for short block length and high rate applications","author":"mackay","year":"1999","journal-title":"The Proc IMA Workshop on Codes"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831861"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.53751"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.959257"},{"key":"11","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":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.814716"},{"journal-title":"Codes and decoding on general graphs","year":"1996","author":"wiberg","key":"20"},{"key":"2","first-page":"535","article-title":"An algebraic method for constructing quasi-cyclic LDPC codes","author":"chen","year":"2004","journal-title":"Proc ISIT"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/26.990903"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1971.1054640"},{"journal-title":"Designs Codes and Cryptography","year":"0","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-005-6685-6"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"journal-title":"Decoding error-correcting codes via linear programming","year":"2003","author":"feldman","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523757"},{"key":"8","first-page":"540","article-title":"Generators and minimum-weight codewords for a class of quasi-cyclic low-density parity-check codes","author":"kamiya","year":"2004","journal-title":"Proc ISIT"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523757.pdf?arnumber=1523757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T16:43:51Z","timestamp":1555865031000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523757\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523757","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}