{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:32:58Z","timestamp":1753885978152,"version":"3.41.2"},"reference-count":13,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T00:00:00Z","timestamp":1207180800000},"content-version":"vor","delay-in-days":93,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60572093","20050004016"],"award-info":[{"award-number":["60572093","20050004016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013286","name":"Specialized Research Fund for the Doctoral Program of Higher Education","doi-asserted-by":"crossref","award":["60572093","20050004016"],"award-info":[{"award-number":["60572093","20050004016"]}],"id":[{"id":"10.13039\/501100013286","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002582","name":"Gwangju Institute of Science and Technology","doi-asserted-by":"publisher","award":["60572093","20050004016"],"award-info":[{"award-number":["60572093","20050004016"]}],"id":[{"id":"10.13039\/501100002582","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>We present an approach for constructing LDPC codes without cycles of length 4 and 6. Firstly, we design 3 submatrices with different shifting functions given by the proposed schemes, then combine them into the matrix specified by the proposed approach, and, finally, expand the matrix into a desired parity\u2010check matrix using identity matrices and cyclic shift matrices of the identity matrices. The simulation result in AWGN channel verifies that the BER of the proposed code is close to those of Mackay\u2032s random codes and Tanner\u2032s QC codes, and the good BER performance of the proposed can remain at high code rates.<\/jats:p>","DOI":"10.1155\/2008\/354137","type":"journal-article","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T17:05:45Z","timestamp":1207242345000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Design LDPC Codes without Cycles of Length 4 and 6"],"prefix":"10.1155","volume":"2008","author":[{"given":"Jun","family":"Fan","sequence":"first","affiliation":[]},{"given":"Yang","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Kiseon","family":"Kim","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,4,3]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.848552"},{"key":"e_1_2_8_4_2","doi-asserted-by":"crossref","unstructured":"KimS. nodoubt@snu.ac.kr NoJ.-S. jsno@snu.ac.kr ChungH. andhabchung@wow.hongik.ac.kr ShinD.-J. djshin@hanyang.ac.kr Girth analysis of Tanner\u2032s (3 5) QC LDPC codes Proceedings of IEEE International Symposium on Information Theory (ISIT \u203205) September 2005 Adelaide SA Australia 1632\u20131636 https:\/\/doi.org\/10.1109\/ISIT.2005.1523621.","DOI":"10.1109\/ISIT.2005.1523621"},{"key":"e_1_2_8_5_2","doi-asserted-by":"crossref","unstructured":"LuJ. jinlu@ece.cmu.edu MouraJ. M. F. andmoura@ece.cmu.edu NiesenU. uniesen@ece.cmu.edu Grouping-and-shifting designs for structured LDPC codes with large girth Proceedings of IEEE International Symposium on Information Theory (ISIT \u203204) June-July 2004 Chicago Ill USA https:\/\/doi.org\/10.1109\/ISIT.2004.1365275.","DOI":"10.1109\/ISIT.2004.1365275"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833037"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2004.829197"},{"key":"e_1_2_8_8_2","doi-asserted-by":"crossref","unstructured":"LuJ. jinlu@ece.cmu.edu MouraJ. M. F. andmoura@ece.cmu.edu NiesenU. A class of structured LDPC codes with large girth 1 Proceedings of IEEE International Conference on Communications June 2004 Paris France 425\u2013429 https:\/\/doi.org\/10.1109\/ICC.2004.1312524.","DOI":"10.1109\/ICC.2004.1312524"},{"key":"e_1_2_8_9_2","doi-asserted-by":"crossref","unstructured":"ZhangH.andhaotian@ece.cmu.edu MouraJ. M. F. moura@ece.cmu.edu The design of structured regular LDPC codes with large girth 7 Proceedings of IEEE Global Telecommunications Conference (GLOBECOM \u203203) December 2003 San Francisco Calif USA 4022\u20134027 https:\/\/doi.org\/10.1109\/GLOCOM.2003.1258984.","DOI":"10.1109\/GLOCOM.2003.1258984"},{"key":"e_1_2_8_10_2","doi-asserted-by":"crossref","unstructured":"XiaoY.andyxiao@center.njtu.edu.cn LeeM. H. moonho@chonbuk.ac.kr Construction of good quasi-cyclic LDPC codes Proceedings of IET International Conference on Wireless Mobile and Multimedia Networks (ICWMMN \u203206) November 2006 Hangzhou China https:\/\/doi.org\/10.1049\/cp:20061337.","DOI":"10.1049\/cp:20061337"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"e_1_2_8_12_2","doi-asserted-by":"crossref","unstructured":"FanJ.andfanjun562@126.com XiaoY. A method of counting the number of cycles in LDPC codes 3 Proceedings of the 8th International Conference on Signal Processing (ICSP \u203206) November 2006 Guilin China 2183\u20132186.","DOI":"10.1109\/ICOSP.2006.345906"},{"key":"e_1_2_8_13_2","unstructured":"MacKayD. J. C. Encyclopedia of sparse graph codes [EB\/OL] http:\/\/www.inference.phy.cam.ac.uk\/mackay\/codes\/data.html."}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2008\/354137.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2008\/354137.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2008\/354137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T13:28:36Z","timestamp":1719581316000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2008\/354137"}},"subtitle":[],"editor":[{"given":"Guosen","family":"Yue","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1155\/2008\/354137"],"URL":"https:\/\/doi.org\/10.1155\/2008\/354137","archive":["Portico"],"relation":{},"ISSN":["2090-0147","2090-0155"],"issn-type":[{"type":"print","value":"2090-0147"},{"type":"electronic","value":"2090-0155"}],"subject":[],"published":{"date-parts":[[2008,1]]},"assertion":[{"value":"2008-01-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-02-25","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-04-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"354137"}}