{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:41:23Z","timestamp":1742960483451,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030191559"},{"type":"electronic","value":"9783030191566"}],"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-19156-6_30","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T12:41:31Z","timestamp":1557146491000},"page":"323-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Puncturing Algorithm for Mixing 2-Kernel and 3-Kernel Polar Codes"],"prefix":"10.1007","author":[{"given":"Xiaojun","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianming","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,7]]},"reference":[{"issue":"7","key":"30_CR1","first-page":"3051","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Press 55(7), 3051\u20133073 (2009)","journal-title":"IEEE Press"},{"issue":"12","key":"30_CR2","doi-asserted-by":"publisher","first-page":"3253","DOI":"10.1109\/TIT.2010.2080990","volume":"56","author":"S-B Korada","year":"2010","unstructured":"Korada, S.-B., Sasoglu, E., Urbanke, R.: Polar codes: characterization of exponent, bounds, and constructions. IEEE Trans. Inf. Theory 56(12), 3253\u20136264 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Wang, X., Zhang, Z., Zhang, L.: On the SC decoder for any polar code of length \n                    \n                      \n                    \n                    $$N =l^n$$\n                  . In: Wireless Communications and Networking Conference, pp. 485\u2013489. IEEE, Istanbul (2014)","DOI":"10.1109\/WCNC.2014.6952076"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Gabry, F., Bioglio, V., Land, I., Belfiore, J.C.: Multi-kernel construction of polar codes. In: 2017 IEEE International Conference on Communications Workshops (ICC Workshops), pp. 761\u2013765. IEEE, Paris (2017)","DOI":"10.1109\/ICCW.2017.7962750"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Eslami, A., Pishro-Nik, H.: A practical approach to polar codes. In: IEEE International Symposium on Information Theory Proceedings, pp. 16\u201320. IEEE, St. Petersburg (2011)","DOI":"10.1109\/ISIT.2011.6033837"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, L., Zhang, Z., Wang, X., Yu, Q.: On the puncturing patterns for punctured polar codes. In: IEEE International Symposium on Information Theory, pp. 121\u2013125. IEEE, Honolulu (2014)","DOI":"10.1109\/ISIT.2014.6874807"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Niu, K., Chen, K., Lin, J.-R.: Beyond turbo codes: rate-compatible punctured polar codes. In: 2013 IEEE International Conference on Communications (ICC), pp. 3423\u20133427. IEEE, Budapest (2013)","DOI":"10.1109\/ICC.2013.6655078"},{"key":"30_CR8","unstructured":"Bioglio, V., Gabry, F., Land, I., Belfiore, J.-C.: Minimum-distance based construction of multi-kernel polar codes. In: 2017 IEEE Global Communications Conference, GLOBECOM 2017, pp. 1\u20136 (2016). IEEE Global Communications Conference 18(12), 2081\u20132084"},{"issue":"12","key":"30_CR9","doi-asserted-by":"publisher","first-page":"2081","DOI":"10.1109\/LCOMM.2014.2364845","volume":"18","author":"R Wang","year":"2016","unstructured":"Wang, R., Liu, R.: A novel puncturing scheme for polar codes. IEEE Commun. Lett. 18(12), 2081\u20132084 (2016)","journal-title":"IEEE Commun. Lett."}],"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-19156-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:33:47Z","timestamp":1558402427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19156-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030191559","9783030191566"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19156-6_30","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"}}]}}