乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T19:21:28Z","timestamp":1720207288441},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T00:00:00Z","timestamp":1183248000000},"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":[[2007,7]]},"DOI":"10.1109\/tit.2007.899516","type":"journal-article","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T19:43:02Z","timestamp":1183059782000},"page":"2429-2458","source":"Crossref","is-referenced-by-count":208,"title":["Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach"],"prefix":"10.1109","volume":"53","author":[{"family":"Lan Lan","sequence":"first","affiliation":[]},{"family":"Lingqi Zeng","sequence":"additional","affiliation":[]},{"given":"Y.Y.","family":"Tai","sequence":"additional","affiliation":[]},{"family":"Lei Chen","sequence":"additional","affiliation":[]},{"family":"Shu Lin","sequence":"additional","affiliation":[]},{"given":"K.","family":"Abdel-Ghaffar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887082"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523755"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842571"},{"key":"ref31","first-page":"50","article-title":"weight distributions: how deviant can you be?","author":"di","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref30","author":"lin","year":"2004","journal-title":"Error Control Coding Fundamentals and Applications"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"ref35","first-page":"147","article-title":"codes correcteurs d'erreurs","volume":"2","author":"hocquenghem","year":"1959","journal-title":"Chiffres"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840867"},{"key":"ref27","first-page":"535","article-title":"an algebraic method for constructing quasi-cyclic ldpc codes","author":"chen","year":"2004","journal-title":"Proc Int Symp Information Theory and its Applications (ISITA)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.841966"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365276"},{"key":"ref22","first-page":"543","article-title":"array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes and Related Topics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871060"},{"key":"ref23","first-page":"365","article-title":"a class of group-structured ldpc codes","author":"tanner","year":"2001","journal-title":"Proc 6th Int Symp Communication Theory and Applications"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523756"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1506715"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023274"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813480"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2004.824125"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/WPMC.2002.1088325"},{"key":"ref10","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref40","first-page":"1426","article-title":"error floors of ldpc codes","author":"richardson","year":"2003","journal-title":"Proc Allerton Conf Communications Control and Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref13","first-page":"226","article-title":"spectral graphs for quasi-cyclic ldpc codes","author":"tanner","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.822737"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.814716"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831353"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828066"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828088"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828144"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref6","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577834"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1203996"},{"key":"ref48","article-title":"ldpc performance vs. number of iterations","author":"andrews","year":"2005","journal-title":"Proc The Consultative Committee for Space Data Systems (CCSDS) Meet"},{"key":"ref47","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 Comm Software Syst"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/ICC.2004.1312605","article-title":"on the computation of the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"Proc 2004 IEEE Int Conf Communications (ICC)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20045118"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.832776"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4252316\/04252336.pdf?arnumber=4252336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:16Z","timestamp":1638218836000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4252336\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":54,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2007.899516","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}