{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:44Z","timestamp":1740169124981,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61971062"],"award-info":[{"award-number":["61971062"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2940045","type":"journal-article","created":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T20:24:27Z","timestamp":1568060667000},"page":"129174-129182","source":"Crossref","is-referenced-by-count":3,"title":["Spatially-Coupled Protograph for NOMA Optimized by the Genetic Algorithm"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8286-2872","authenticated-orcid":false,"given":"Zhongwei","family":"Si","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoguo","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2596438"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2015.7341294"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2622706"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2016.7504241"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2014.7063568"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2599521"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996395"},{"key":"ref17","first-page":"41","article-title":"A heuristic search for good low-density parity-check codes at short block lengths","volume":"1","author":"mao","year":"2001","journal-title":"Proc IEEE Int Conf Commun (ICC)"},{"key":"ref18","first-page":"311","article-title":"Novel method for counting short cycles of Tanner graphs","volume":"37","author":"jiao","year":"2010","journal-title":"J Xidian Univ"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2848294"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2725519"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.909320"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2017.1700069"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2631468"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2013.6666156"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPCS.2015.7391767"},{"key":"ref7","first-page":"383","article-title":"Performance evaluation of low density spreading multiple access","author":"mohammed","year":"2012","journal-title":"Proc 8th Int Wireless Commun Mobile Comput Conf (IWCMC)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2015.7263349"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2016.7405732"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613301"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/6497340"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2893928"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2792019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2453267"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2794062"},{"journal-title":"Genetic Algorithms and Grouping Problems","year":"1998","author":"falkenauer","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2400445"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08827498.pdf?arnumber=8827498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:31:31Z","timestamp":1641987091000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8827498\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2940045","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}