{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:34:22Z","timestamp":1743089662257,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030191528"},{"type":"electronic","value":"9783030191535"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-19153-5_71","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T12:33:13Z","timestamp":1557145993000},"page":"727-737","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Low Complexity Decoding Scheme for LDPC Codes Based on Belief Propagation Algorithm"],"prefix":"10.1007","author":[{"given":"Wenshuo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aijun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,7]]},"reference":[{"issue":"1","key":"71_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R. Gallager","year":"1962","unstructured":"Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory, IT-18, 21\u201328 (1962)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"18","key":"71_CR2","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"DJC MacKay","year":"1996","unstructured":"MacKay, D.J.C., Neal, R.M.: Near Shannon limit performance of low density parity check codes. Electron. Lett. 32(18), 1645\u20131646 (1996)","journal-title":"Electron. Lett."},{"key":"71_CR3","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"TJ Richardson","year":"2001","unstructured":"Richardson, T.J., Shokrollahi, M.A., Urbanke, R.: Design of capacity-approaching irregular low-densityparity-check codes. IEEE Trans. Inf. Theory 47, 619\u2013637 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"71_CR4","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"X-Y Hu","year":"2005","unstructured":"Hu, X.-Y., Eleftheriou, E., Arnold, D.-M.: Regular and irregular progressive edge-growth tanner graphs. IEEE Trans. Inform. Theory 51, 386\u201398 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"71_CR5","doi-asserted-by":"crossref","unstructured":"Prompakdee, P., Phakphisut, W., Supnithi, P.: Quasi cyclic-LDPC codes based on PEG algorithm with maximized girth property. In: IEEE International Symposium on Intelligent Signal Processing and Communications Systems, pp. 1\u20134 (2012)","DOI":"10.1109\/ISPACS.2011.6146165"},{"key":"71_CR6","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"MPC Fossorier","year":"1999","unstructured":"Fossorier, M.P.C., Mihaljevic, M., Imai, I.: Reduced complexity iterative decoding of low density parity check codes based on belief propagation. IEEE Trans. Commun. 47, 673\u2013680 (1999)","journal-title":"IEEE Trans. Commun."},{"key":"71_CR7","unstructured":"Ning, H., Hua, Q.: Research of LDPC decoding based on modified LLR BP algorithm. J. Southwest Univ. (Nat. Sci. Ed.) 119\u2013124 (2009)"},{"key":"71_CR8","volume-title":"Principle and Application of LDPC","author":"H Jia","year":"2009","unstructured":"Jia, H.: Principle and Application of LDPC, 1st edn. People\u2019s Posts and Telecommunications Press, Beijing (2009)","edition":"1"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Wireless and Satellite Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19153-5_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:40:07Z","timestamp":1558402807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19153-5_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030191528","9783030191535"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19153-5_71","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"7 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WiSATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless and Satellite Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Harbin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"psats2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/psats.eu\/","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":"http:\/\/confy.eai.eu\/","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"289","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"138","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":"48% - 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":"3","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"}}]}}