{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:17:01Z","timestamp":1740133021099,"version":"3.37.3"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61201265","61376027"],"award-info":[{"award-number":["61201265","61376027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1109\/lcomm.2015.2477812","type":"journal-article","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T14:31:56Z","timestamp":1441981916000},"page":"1869-1872","source":"Crossref","is-referenced-by-count":2,"title":["On the Minimum Distance of Full-Length RS-LDPC Codes"],"prefix":"10.1109","volume":"19","author":[{"given":"Haiyang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Lianrong","family":"Ma","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834760"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"journal-title":"Applied Combinatorics","year":"1984","author":"roberts","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911177"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref15","first-page":"1","article-title":"Finding small stopping sets in the Tanner graphs of LDPC codes","author":"richter","year":"0","journal-title":"Proc IEEE Int Symp Turbo Codes Related Topics"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.24138\/jcomss.v2i3.283","article-title":"Design of LDPC codes: A survey and new results","volume":"2","author":"liva","year":"2006","journal-title":"J Commun Softw Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"year":"2006","key":"ref6"},{"key":"ref5","first-page":"317","article-title":"Construction of low-density parity-check codes based on Reed-Solomon codes with two information symbols","volume":"8","author":"djurdjevic","year":"2004","journal-title":"IEEE Commun Lett"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2005.861751"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2399395"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"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":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7322307\/07258329.pdf?arnumber=7258329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:57Z","timestamp":1641988017000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7258329\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":15,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2015.2477812","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}