{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:00:30Z","timestamp":1758272430900},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513621","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"839-843","source":"Crossref","is-referenced-by-count":3,"title":["Two-dimensional generalized Reed-Solomon codes: A unified framework for quasi-cyclic LDPC codes constructed based on finite fields"],"prefix":"10.1109","author":[{"given":"Chao","family":"Chen","sequence":"first","affiliation":[]},{"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Xinmei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"2285","article-title":"Constructions of quasi-cyclic LDPC codes for AWGN and binary erasure channels based on finite fields and affine permutations","author":"lan","year":"2005","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref11","article-title":"Quasi-cyclic LDPC codes: construction based on additive groups of finite fields","author":"lin","year":"2009","journal-title":"Lecture notes"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454149"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref14","first-page":"767","article-title":"On the computation of the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"Proc IEEE Int Conf Communications"},{"article-title":"Bounds on the minimum distance of linear codes and quantum codes","year":"0","author":"markus","key":"ref15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.814716"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.21236\/AD0407946","author":"massey","year":"1963","journal-title":"Threshold Decoding"},{"key":"ref5","first-page":"239","article-title":"Construction of quasi-cyclic LDPC codes based on the minimum weight codewords of Reed-Solomon codes","author":"chen","year":"2004","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.0901.060129"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCAS.2006.284883"}],"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\/05513621.pdf?arnumber=5513621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T23:38:59Z","timestamp":1559432339000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513621\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513621","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}