{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:33:07Z","timestamp":1730215987400,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ecctd.2005.1523112","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T11:51:59Z","timestamp":1160567519000},"page":"269-272","source":"Crossref","is-referenced-by-count":2,"title":["Versatile architectures for decoding a class of LDPC codes"],"prefix":"10.1109","volume":"3","author":[{"given":"A.","family":"Byrne","sequence":"first","affiliation":[]},{"given":"E.M.","family":"Popovici","sequence":"additional","affiliation":[]},{"given":"M.","family":"O'Sullivan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826367"},{"key":"13","first-page":"1301","article-title":"An algorithm for multiplication modulo 2N-1","volume":"3","author":"wang","year":"1996","journal-title":"IEEE 39th Midwest symposium on"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2002.801901"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0165-3_4"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862120"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"2","first-page":"110","article-title":"Good codes based on very sparse matrices","volume":"1025","author":"mackay","year":"1995","journal-title":"MIT Press Cambridge Mass"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"7","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"},{"key":"6","article-title":"Performance analysis of finite-length LDPC codes","author":"xue","year":"2003","journal-title":"Proc IEEE Workshop Signal Processing Adv Wireless Commun"},{"key":"5","article-title":"Construction of LDPC codes from affine permutation matrices","author":"o'sullivan","year":"2002","journal-title":"Proc of the 40th Annual Allerton Conference on Communication Control and Computing"},{"key":"4","first-page":"437","article-title":"Architectures and implementations of low-density parity check decoding algorithms","author":"engling","year":"2002","journal-title":"45th IEEE Midwest Symposium on Circuits and Systems"},{"key":"9","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc 6th ICSTA"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3585-7_13"}],"event":{"name":"2005 European Conference on Circuit Theory and Design, 2005.","location":"Cork, Ireland"},"container-title":["Proceedings of the 2005 European Conference on Circuit Theory and Design, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10211\/32580\/01523112.pdf?arnumber=1523112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T23:03:39Z","timestamp":1489532619000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523112\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ecctd.2005.1523112","relation":{},"subject":[]}}