{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:44:09Z","timestamp":1761745449331,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100009467","name":"University of the Witwatersrand Johannesburg","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009467","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3060806","type":"journal-article","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T23:13:05Z","timestamp":1614035585000},"page":"33464-33477","source":"Crossref","is-referenced-by-count":8,"title":["Predictive Syndrome Based Low Complexity Joint Iterative Detection-Decoding Algorithm for Non-Binary LDPC Codes"],"prefix":"10.1109","volume":"9","author":[{"given":"Waheed","family":"Ullah","sequence":"first","affiliation":[]},{"given":"Ling","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Fambirai","family":"Takawira","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/NSWCTC.2010.59"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2016.2551550"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312606"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2011.2164951"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011435"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2005.1494432"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1201\/b18673"},{"journal-title":"Regular Ultra-Sparse Graphs and Related Non-Binary LDPC Codes","year":"2020","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2370032"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICFCC.2010.5497659"},{"key":"ref12","first-page":"1","article-title":"Iterative plurality-logic and generalized algorithm B decoding of Q-ary LDPC codes","author":"jagiello","year":"2011","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.051313.130303"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2418260"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613849"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.030914.132867"},{"key":"ref17","first-page":"111","article-title":"Comprehensive algorithmic review and analysis of LDPC codes","volume":"16","author":"ullah","year":"2015","journal-title":"Indonesian J Electr Eng Comput Sci"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/26.990903"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894088"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2702196"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2501298"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2487454"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2003.1216697"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3013814"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060527"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC48278.2020.9217108"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190138"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091310.090327"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/s20082300"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2623783"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.05.070096"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595129"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.050813.120489"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2015.7124675"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1049\/el.2010.0566"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2013.0684"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513632"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09359751.pdf?arnumber=9359751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:57Z","timestamp":1639771017000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9359751\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3060806","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}