{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T06:24:22Z","timestamp":1766298262303,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251146"},{"type":"electronic","value":"9783031251153"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25115-3_1","type":"book-chapter","created":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T13:57:23Z","timestamp":1674914243000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["High-Performance Steganographic Coding Based on\u00a0Sub-Polarized Channel"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9088-0571","authenticated-orcid":false,"given":"Haocheng","family":"Fu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-8399","authenticated-orcid":false,"given":"Xianfeng","family":"Zhao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5770-7192","authenticated-orcid":false,"given":"Xiaolei","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,29]]},"reference":[{"issue":"12","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/LCOMM.2011.101811.111480","volume":"15","author":"A Alamdar-Yazdi","year":"2011","unstructured":"Alamdar-Yazdi, A., Kschischang, F.R.: A simplified successive-cancellation decoder for polar codes. IEEE Commun. Lett. 15(12), 1378\u20131380 (2011)","journal-title":"IEEE Commun. Lett."},{"issue":"7","key":"1_CR2","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","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 Trans. Inf. Theory 55(7), 3051\u20133073 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-24178-9_5","volume-title":"Information Hiding","author":"P Bas","year":"2011","unstructured":"Bas, P., Filler, T., Pevn\u00fd, T.: \u201cBreak our steganographic system\u2019\u2019: the ins and outs of organizing BOSS. In: Filler, T., Pevn\u00fd, T., Craver, S., Ker, A. (eds.) IH 2011. LNCS, vol. 6958, pp. 59\u201370. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24178-9_5"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Cogranne, R., Giboulot, Q., Bas, P.: Alaska# 2: challenging academic research on steganalysis with realistic images. In: 2020 IEEE International Workshop on Information Forensics and Security (WIFS), pp. 1\u20135. IEEE (2020)","DOI":"10.1109\/WIFS49906.2020.9360896"},{"key":"1_CR5","unstructured":"Crandall, R.: Some notes on steganography. Posted on Steganography Mailing List 1998, 1\u20136 (1998)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Diop, I., Farss, S., Tall, K., Fall, P., Diouf, M., Diop, A.: Adaptive steganography scheme based on LDPC codes. In: 16th International Conference on Advanced Communication Technology, pp. 162\u2013166. IEEE (2014)","DOI":"10.1109\/ICACT.2014.6778941"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Diouf, B., et al.: JPEG steganography based on successive cancellation decoding of polar codes. In: 2022 2nd International Conference on Innovative Research in Applied Science, Engineering and Technology (IRASET), pp. 1\u20136. IEEE (2022)","DOI":"10.1109\/IRASET52964.2022.9738088"},{"key":"1_CR8","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-72965-7_18","volume-title":"Innovation and Interdisciplinary Solutions for Underserved Areas","author":"B Diouf","year":"2018","unstructured":"Diouf, B., et al.: Polar coding steganographic embedding using successive cancellation. In: M. F. Kebe, C., Gueye, A., Ndiaye, A. (eds.) InterSol\/CNRIA -2017. LNICST, vol. 204, pp. 189\u2013201. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72965-7_18"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Filler, T., Judas, J., Fridrich, J.: Minimizing embedding impact in steganography using trellis-coded quantization. In: Media Forensics and Security II, vol. 7541, pp. 38\u201351. SPIE (2010)","DOI":"10.1117\/12.838002"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/TIFS.2011.2134094","volume":"6","author":"T Filler","year":"2011","unstructured":"Filler, T., Judas, J., Fridrich, J.: Minimizing additive distortion in steganography using syndrome-trellis codes. IEEE Trans. Inf. Forensics Secur. 6(3), 920\u2013935 (2011)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139192903","volume-title":"Steganography in Digital Media: Principles, Algorithms, and Applications","author":"J Fridrich","year":"2009","unstructured":"Fridrich, J.: Steganography in Digital Media: Principles, Algorithms, and Applications. Cambridge University Press, Cambridge (2009)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Fridrich, J., Filler, T.: Practical methods for minimizing embedding impact in steganography. In: Security, Steganography, and Watermarking of Multimedia Contents IX, vol. 6505, pp. 13\u201327. SPIE (2007)","DOI":"10.1117\/12.697471"},{"issue":"10","key":"1_CR13","doi-asserted-by":"publisher","first-page":"3923","DOI":"10.1109\/TSP.2005.855393","volume":"53","author":"J Fridrich","year":"2005","unstructured":"Fridrich, J., Goljan, M., Lisonek, P., Soukal, D.: Writing on wet paper. IEEE Trans. Signal Process. 53(10), 3923\u20133935 (2005)","journal-title":"IEEE Trans. Signal Process."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11558859_16","volume-title":"Information Hiding","author":"J Fridrich","year":"2005","unstructured":"Fridrich, J., Goljan, M., Soukal, D.: Efficient wet paper codes. In: Barni, M., Herrera-Joancomart\u00ed, J., Katzenbeisser, S., P\u00e9rez-Gonz\u00e1lez, F. (eds.) IH 2005. LNCS, vol. 3727, pp. 204\u2013218. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11558859_16"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Guo, L., Ni, J., Shi, Y.Q.: An efficient JPEG steganographic scheme using uniform embedding. In: 2012 IEEE International Workshop on Information Forensics and Security (WIFS), pp. 169\u2013174. IEEE (2012)","DOI":"10.1109\/WIFS.2012.6412644"},{"issue":"12","key":"1_CR16","doi-asserted-by":"publisher","first-page":"2669","DOI":"10.1109\/TIFS.2015.2473815","volume":"10","author":"L Guo","year":"2015","unstructured":"Guo, L., Ni, J., Su, W., Tang, C., Shi, Y.Q.: Using statistical image model for JPEG steganography: uniform embedding revisited. IEEE Trans. Inf. Forensics Secur. 10(12), 2669\u20132680 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"11","key":"1_CR17","doi-asserted-by":"publisher","first-page":"2360","DOI":"10.1109\/LCOMM.2017.2740305","volume":"21","author":"M Hanif","year":"2017","unstructured":"Hanif, M., Ardakani, M.: Fast successive-cancellation decoding of polar codes: identification and decoding of new nodes. IEEE Commun. Lett. 21(11), 2360\u20132363 (2017)","journal-title":"IEEE Commun. Lett."},{"issue":"12","key":"1_CR18","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1109\/TCSI.2016.2619324","volume":"63","author":"SA Hashemi","year":"2016","unstructured":"Hashemi, S.A., Condo, C., Gross, W.J.: A fast polar code list decoder architecture based on sphere decoding. IEEE Trans. Circuits Syst. I Regul. Pap. 63(12), 2368\u20132380 (2016)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TIFS.2014.2364918","volume":"10","author":"V Holub","year":"2014","unstructured":"Holub, V., Fridrich, J.: Low-complexity features for JPEG steganalysis using undecimated DCT. IEEE Trans. Inf. Forensics Secur. 10(2), 219\u2013228 (2014)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1687-417X-2014-1","volume":"2014","author":"V Holub","year":"2014","unstructured":"Holub, V., Fridrich, J., Denemark, T.: Universal distortion function for steganography in an arbitrary domain. EURASIP J. Inf. Secur. 2014(1), 1\u201313 (2014). https:\/\/doi.org\/10.1186\/1687-417X-2014-1","journal-title":"EURASIP J. Inf. Secur."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Leroux, C., Tal, I., Vardy, A., Gross, W.J.: Hardware architectures for successive cancellation decoding of polar codes. In: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1665\u20131668. IEEE (2011)","DOI":"10.1109\/ICASSP.2011.5946819"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Li, B., Wang, M., Huang, J., Li, X.: A new cost function for spatial image steganography. In: 2014 IEEE International Conference on Image Processing (ICIP), pp. 4206\u20134210. IEEE (2014)","DOI":"10.1109\/ICIP.2014.7025854"},{"issue":"7","key":"1_CR23","doi-asserted-by":"publisher","first-page":"3948","DOI":"10.1109\/TCOMM.2020.2982624","volume":"68","author":"W Li","year":"2020","unstructured":"Li, W., Zhang, W., Li, L., Zhou, H., Yu, N.: Designing near-optimal steganographic codes in practice based on polar codes. IEEE Trans. Commun. 68(7), 3948\u20133962 (2020)","journal-title":"IEEE Trans. Commun."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Oliveira, R.M., de Lamare, R.C.: Non-uniform channel polarization and design of rate-compatible polar codes. In: 2019 16th International Symposium on Wireless Communication Systems (ISWCS), pp. 537\u2013541. IEEE (2019)","DOI":"10.1109\/ISWCS.2019.8877311"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-16435-4_13","volume-title":"Information Hiding","author":"T Pevn\u00fd","year":"2010","unstructured":"Pevn\u00fd, T., Filler, T., Bas, P.: Using high-dimensional image models to perform highly undetectable steganography. In: B\u00f6hme, R., Fong, P.W.L., Safavi-Naini, R. (eds.) IH 2010. LNCS, vol. 6387, pp. 161\u2013177. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16435-4_13"},{"key":"1_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253","volume-title":"Channel Codes: Classical and Modern","author":"W Ryan","year":"2009","unstructured":"Ryan, W., Lin, S.: Channel Codes: Classical and Modern. Cambridge University Press, Cambridge (2009)"},{"issue":"5","key":"1_CR27","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1109\/JSAC.2014.140514","volume":"32","author":"G Sarkis","year":"2014","unstructured":"Sarkis, G., Giard, P., Vardy, A., Thibeault, C., Gross, W.J.: Fast polar decoders: algorithm and implementation. IEEE J. Sel. Areas Commun. 32(5), 946\u2013957 (2014)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrch, C.: A partial order for the synthesized channels of a polar code. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 220\u2013224. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541293"},{"issue":"5","key":"1_CR29","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1109\/TIT.2015.2410251","volume":"61","author":"I Tal","year":"2015","unstructured":"Tal, I., Vardy, A.: List decoding of polar codes. IEEE Trans. Inf. Theory 61(5), 2213\u20132226 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-45496-9_21","volume-title":"Information Hiding","author":"A Westfeld","year":"2001","unstructured":"Westfeld, A.: High capacity despite better steganalysis (F5\u2014a steganographic algorithm). In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol. 2137, pp. 289\u2013302. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45496-9_21"},{"issue":"12","key":"1_CR31","doi-asserted-by":"publisher","first-page":"7272","DOI":"10.1109\/TIT.2012.2217072","volume":"58","author":"R Zhang","year":"2012","unstructured":"Zhang, R., Sachnev, V., Botnan, M.B., Kim, H.J., Heo, J.: An efficient embedder for bch coding for steganography. IEEE Trans. Inf. Theory 58(12), 7272\u20137279 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-04431-1_4","volume-title":"Information Hiding","author":"R Zhang","year":"2009","unstructured":"Zhang, R., Sachnev, V., Kim, H.J.: Fast BCH syndrome coding for steganography. In: Katzenbeisser, S., Sadeghi, A.-R. (eds.) IH 2009. LNCS, vol. 5806, pp. 48\u201358. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04431-1_4"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Zhao, S., Shi, P., Wang, B.: Designs of Bhattacharyya parameter in the construction of polar codes. In: 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, pp. 1\u20134. IEEE (2011)","DOI":"10.1109\/wicom.2011.6040179"}],"container-title":["Lecture Notes in Computer Science","Digital Forensics and Watermarking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25115-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T13:57:54Z","timestamp":1674914274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25115-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251146","9783031251153"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25115-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWDW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Digital Watermarking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guilin","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwdw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwdw.site\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - 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 (provided by the conference organizers)"}},{"value":"2.23","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.43","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}