{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:33:43Z","timestamp":1763105623409,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030011673"},{"type":"electronic","value":"9783030011680"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01168-0_15","type":"book-chapter","created":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T00:03:17Z","timestamp":1538092997000},"page":"162-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel"],"prefix":"10.1007","author":[{"given":"Anton","family":"Glebov","sequence":"first","affiliation":[]},{"given":"Luiza","family":"Medova","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8255-2161","authenticated-orcid":false,"given":"Pavel","family":"Rybin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6734-0179","authenticated-orcid":false,"given":"Alexey","family":"Frolov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,29]]},"reference":[{"issue":"10","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1109\/26.957394","volume":"49","author":"S Brink ten","year":"2001","unstructured":"ten Brink, S.: Convergence behavior of iteratively decoded parallel concatenated codes. IEEE Trans. Commun. 49(10), 1727\u20131737 (2001). https:\/\/doi.org\/10.1109\/26.957394","journal-title":"IEEE Trans. Commun."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Gallager, R.G.: Low-density parity-check codes (1963)","DOI":"10.1109\/TIT.1962.1057683"},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TSP.2007.909320","volume":"56","author":"R Hoshyar","year":"2008","unstructured":"Hoshyar, R., Wathan, F.P., Tafazolli, R.: Novel low-density signature for synchronous CDMA systems over AWGN channel. IEEE Trans. Signal Process. 56(4), 1616\u20131626 (2008). https:\/\/doi.org\/10.1109\/TSP.2007.909320","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TCOMM.2010.120710.100054","volume":"59","author":"G Liva","year":"2011","unstructured":"Liva, G.: Graph-based analysis and optimization of contention resolution diversity slotted aloha. IEEE Trans. Commun. 59(2), 477\u2013487 (2011). https:\/\/doi.org\/10.1109\/TCOMM.2010.120710.100054","journal-title":"IEEE Trans. Commun."},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Liva, G., Chiani, M.: Protograph LDPC codes design based on EXIT analysis. In: IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference, pp. 3250\u20133254, November 2007. https:\/\/doi.org\/10.1109\/GLOCOM.2007.616","DOI":"10.1109\/GLOCOM.2007.616"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Narayanan, K.R., Pfister, H.D.: Iterative collision resolution for slotted ALOHA: an optimal uncoordinated transmission policy. In: 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), pp. 136\u2013139, August 2012. https:\/\/doi.org\/10.1109\/ISTC.2012.6325214","DOI":"10.1109\/ISTC.2012.6325214"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Ordentlich, O., Polyanskiy, Y.: Low complexity schemes for the random access Gaussian channel. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 2528\u20132532, June 2017. https:\/\/doi.org\/10.1109\/ISIT.2017.8006985","DOI":"10.1109\/ISIT.2017.8006985"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Polyanskiy, Y.: A perspective on massive random-access. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 2523\u20132527. IEEE (2017)","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"15_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"T Richardson","year":"2008","unstructured":"Richardson, T., Urbanke, R.: Modern Coding Theory. Cambridge University Press, New York (2008)"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/18.485709","volume":"42","author":"B Rimoldi","year":"1996","unstructured":"Rimoldi, B., Urbanke, R.: A rate-splitting approach to the Gaussian multiple-access channel. IEEE Trans. Inf. Theory 42(2), 364\u2013375 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1687-1499-2014-3","volume":"2014","author":"I Shahid","year":"2014","unstructured":"Shahid, I., Yahampath, P.: Distributed joint source-channel code design for GMAC using irregular LDPC codes. EURASIP J. Wirel. Commun. Netw. 2014(1), 3 (2014). https:\/\/doi.org\/10.1186\/1687-1499-2014-3","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"5","key":"15_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R Tanner","year":"1981","unstructured":"Tanner, R.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27(5), 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR13","first-page":"1","volume":"154","author":"J Thorpe","year":"2003","unstructured":"Thorpe, J.: Low-density parity-check (LDPC) codes constructed from protographs. Interplanet. Netw. Prog. Rep. 154, 1\u20137 (2003)","journal-title":"Interplanet. Netw. Prog. Rep."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Vem, A., Narayanan, K.R., Cheng, J., Chamberland, J.F.: A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel. In: Proceedings of the IEEE Information Theory Workshop (ITW), pp. 1\u20135 (2017)","DOI":"10.1109\/ITW.2017.8278023"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01168-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T20:58:25Z","timestamp":1571950705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01168-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030011673","9783030011680"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01168-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"NEW2AN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Next Generation Wired\/Wireless Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"new2an2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.new2an.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"186","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}