{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:16:44Z","timestamp":1730193404974,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/5gwf.2019.8911623","type":"proceedings-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T06:23:11Z","timestamp":1575008591000},"page":"22-27","source":"Crossref","is-referenced-by-count":0,"title":["A sectional degree match approximate Min-sum decoding algorithm for LDPC"],"prefix":"10.1109","author":[{"given":"Ruizhen","family":"Wu","sequence":"first","affiliation":[]},{"given":"Lin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Feng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISAECT.2018.8618780"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8341985"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2702632"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3196135"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2818713"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3850\/9783981537079_0250"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2228305"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2011.6105314"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/el:20083019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2899106"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/26.768759"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2776561"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2752086"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1504","DOI":"10.1109\/LCOMM.2012.073112.120996","article-title":"FFT Based Sum-Product Algorithm for Decoding LDPC Lattices","volume":"16","author":"lida","year":"2012","journal-title":"IEEE Communications Letters"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2006.882204"}],"event":{"name":"2019 IEEE 2nd 5G World Forum (5GWF)","start":{"date-parts":[[2019,9,30]]},"location":"Dresden, Germany","end":{"date-parts":[[2019,10,2]]}},"container-title":["2019 IEEE 2nd 5G World Forum (5GWF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8894900\/8911609\/08911623.pdf?arnumber=8911623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:55:16Z","timestamp":1658080516000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8911623\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/5gwf.2019.8911623","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}