{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:26Z","timestamp":1740123686687,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T00:00:00Z","timestamp":1647302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T00:00:00Z","timestamp":1647302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771393"],"award-info":[{"award-number":["61771393"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11036-022-01935-5","type":"journal-article","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T05:02:37Z","timestamp":1647320557000},"page":"285-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SCMA Joint Coding and Decoding Algorithm Based on Code Reliability"],"prefix":"10.1007","volume":"28","author":[{"given":"Hongwei","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanzhu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,15]]},"reference":[{"issue":"3","key":"1935_CR1","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/JSAC.2016.2525418","volume":"34","author":"MR Palattella","year":"2016","unstructured":"Palattella MR, Dohler M, Grieco A (2016) Internet of things in the 5G era: enablers, architecture, and business models[J]. IEEE Journal on Selected Areas in Communications 34(3):510\u2013527","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"1935_CR2","doi-asserted-by":"crossref","unstructured":"Saito Y, Kishiyama Y, Benjebbour A, et al. (2013) Non-orthogonal multiple access (NOMA) for cellular future radio access[C]. 2013 IEEE 77th Vehicular Technology Conference (VTC Spring), Dresden: IEEE Press, 1\u20135","DOI":"10.1109\/VTCSpring.2013.6692652"},{"issue":"2","key":"1935_CR3","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1109\/TCOMM.2015.2511078","volume":"64","author":"Y Zheng","year":"2016","unstructured":"Zheng Y, Zhiguo D, Pingzhi F et al (2016) On the performance of non-orthogonal multiple access systems with partial channel information[J]. IEEE Trans Commun 64(2):654\u2013667","journal-title":"IEEE Trans Commun"},{"key":"1935_CR4","unstructured":"Bichai W, Kun W, Zhaohua L et al. (2015) Comparison study of non-orthogonal multiple access schemes for 5G[C]. 2015 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, Ghent: IEEE Press, 1\u20135"},{"key":"1935_CR5","doi-asserted-by":"crossref","unstructured":"Saito Y, Benjebbour A, Kishiyama Y, et al. (2013) System-level performance evaluation of downlink non-orthogonal multiple access (NOMA)[C]. 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), London: IEEE Press, 611\u2013615","DOI":"10.1109\/PIMRC.2013.6666209"},{"key":"1935_CR6","doi-asserted-by":"crossref","unstructured":"Nikopour H, Baligh H (2013) Sparse code multiple access[C]. IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, London, 332\u2013336","DOI":"10.1109\/PIMRC.2013.6666156"},{"issue":"2","key":"1935_CR7","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/COMST.2016.2621116","volume":"19","author":"SMR Islam","year":"2016","unstructured":"Islam SMR, Avazov N, Dobre OA (2016) Power-domain non-orthogonal multiple access (NOMA) in 5G systems: potentials and challenges[J]. IEEE Communications Surveys &Tutorials 19(2):721\u2013741","journal-title":"IEEE Communications Surveys &Tutorials"},{"issue":"6","key":"1935_CR8","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1109\/LCOMM.2020.2981024","volume":"24","author":"M Aldababsa","year":"2020","unstructured":"Aldababsa M, G\u00f6ztepe C, Kurt GK (2020) Bit error rate for NOMA network[J]. IEEE Commun Lett 24(6):1188\u20131191","journal-title":"IEEE Commun Lett"},{"key":"1935_CR9","doi-asserted-by":"crossref","unstructured":"Lian J, Zhou S, Zhang X (2017) Low Complexity Decoding Method for SCMA in Uplink Random Access[C]. Global Communications Conference. IEEE, Washington","DOI":"10.1109\/GLOCOM.2016.7841966"},{"issue":"3","key":"1935_CR10","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1109\/JSTSP.2019.2898323","volume":"13","author":"J Dai","year":"2019","unstructured":"Dai J, Niu K, Lin J (2019) Iterative Gaussian-approximated message passing receiver for MIMO-SCMA system[J]. IEEE Journal of Selected Topics in Signal Processing 13(3):753\u2013765","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"7","key":"1935_CR11","first-page":"749","volume":"59","author":"S Min","year":"2019","unstructured":"Min S, Jia L, Yun H (2019) A dynamic sub-graph detection algorithm for uplink SCMA systems[J]. Telecommunication Engineering 59(7):749\u2013754","journal-title":"Telecommunication Engineering"},{"issue":"9","key":"1935_CR12","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1109\/LCOMM.2016.2592912","volume":"20","author":"D Yang","year":"2016","unstructured":"Yang D, Dong B, Chen Z (2016) Low-complexity detector in sparse code multiple access systems[J]. IEEE Commun Lett 20(9):1812\u20131815","journal-title":"IEEE Commun Lett"},{"issue":"8","key":"1935_CR13","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.1109\/LCOMM.2017.2697425","volume":"21","author":"L Yang","year":"2017","unstructured":"Yang L, Ma X, Siu Y (2017) Low complexity MPA detector based on sphere decoding for SCMA[J]. IEEE Commun Lett 21(8):1855\u20131858","journal-title":"IEEE Commun Lett"},{"key":"1935_CR14","doi-asserted-by":"crossref","unstructured":"Zhang Z, Han K, Hu J (2016) Joint Detection and Decoding Schemes for Turbo Coded SCMA Systems[C]. Globecom Workshops (GC Wkshps), Washington, DC","DOI":"10.1109\/GLOCOMW.2016.7848941"},{"key":"1935_CR15","doi-asserted-by":"crossref","unstructured":"Wu Y, Zhang S, Chen Y (2015) Iterative multiuser receiver in sparse code multiple access systems[C]. 2015 IEEE International Conference on Communications (ICC), London, 2918\u20132923","DOI":"10.1109\/ICC.2015.7248770"},{"issue":"5","key":"1935_CR16","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/LSP.2016.2544792","volume":"23","author":"C Jienan","year":"2016","unstructured":"Jienan C, Zhenbing Z, Shuaining H (2016) Sparse code multiple access decoding based on a Monte Carlo Markov chain method[J]. IEEE signal processing letters 23(5):639\u2013643","journal-title":"IEEE signal processing letters"},{"key":"1935_CR17","doi-asserted-by":"crossref","unstructured":"Taherzadeh M, Nikopour H, Bayesteh A, et al. (2014) SCMA Codebook Design[C]. 2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall). IEEE","DOI":"10.1109\/VTCFall.2014.6966170"},{"issue":"4","key":"1935_CR18","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/LCOMM.2018.2792019","volume":"22","author":"M Kim","year":"2018","unstructured":"Kim M, Kim N, Lee W, Cho D (2018) Deep learning-aided SCMA[J]. IEEE Commun Lett 22(4):720\u2013723","journal-title":"IEEE Commun Lett"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-022-01935-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-022-01935-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-022-01935-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T20:45:51Z","timestamp":1694119551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-022-01935-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,15]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1935"],"URL":"https:\/\/doi.org\/10.1007\/s11036-022-01935-5","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2022,3,15]]},"assertion":[{"value":"13 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}