{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:39:55Z","timestamp":1742985595064,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030688509"},{"type":"electronic","value":"9783030688516"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-68851-6_19","type":"book-chapter","created":{"date-parts":[[2021,2,4]],"date-time":"2021-02-04T07:04:02Z","timestamp":1612422242000},"page":"266-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cubic Permutation Polynomials-Based Block RLNC Algorithm in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Hongwei","family":"Luo","sequence":"first","affiliation":[]},{"given":"Wanyi","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Baolin","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,5]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jnca.2014.09.002","volume":"46","author":"MZ Farooqi","year":"2014","unstructured":"Farooqi, M.Z., Tabassum, S.M., Rehmani, M.H., Saleem, Y.: A survey on network coding: from traditional wireless networks to emerging cognitive radio networks. J. Netw. Comput. Appl. 46, 166\u2013181 (2014). https:\/\/doi.org\/10.1016\/j.jnca.2014.09.002","journal-title":"J. Netw. Comput. Appl."},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"107650","DOI":"10.1109\/ACCESS.2020.3001137","volume":"8","author":"Y Song","year":"2020","unstructured":"Song, Y., Luo, H.W., Pi, S.C., Gui, C., Sun, B.L.: Graph kernel based clustering algorithm in MANETs. IEEE Access 8(1), 107650\u2013107660 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3001137","journal-title":"IEEE Access"},{"issue":"10","key":"19_CR3","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"Ho, T., M\u00e9dard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J.: A random linear network coding approach to multicast. IEEE Trans. Inf. Theory 52(10), 4413\u20134430 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.881746","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Huang, C.L., Sun, B.L., Song, Y., Gui, C.: A quadratic permutation polynomials enhancement of a RLNC approach in MANETs. In: The 2019 6th International Conference on Systems and Informatics (ICSAI 2019), Shanghai, China, 2\u20134 November 2019, pp. 683\u2013687 (2019). https:\/\/doi.org\/10.1109\/ICSAI48974.2019.9010353","DOI":"10.1109\/ICSAI48974.2019.9010353"},{"issue":"8","key":"19_CR5","doi-asserted-by":"publisher","first-page":"7050","DOI":"10.1109\/TVT.2017.2670178","volume":"66","author":"I Chatzigeorgiou","year":"2017","unstructured":"Chatzigeorgiou, I., Tassi, A.: Decoding delay performance of random linear network coding for broadcast. IEEE Trans. Veh. Technol. 66(8), 7050\u20137060 (2017). https:\/\/doi.org\/10.1109\/TVT.2017.2670178","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1109\/COMST.2017.2665587","volume":"19","author":"A Douik","year":"2017","unstructured":"Douik, A., Sorour, S., Al-Naffouri, T.Y., Alouini, M.-S.: Instantly decodable network coding: from centralized to device-to-device communications. IEEE Commun. Surv. Tutorials 19(2), 1201\u20131224 (2017). https:\/\/doi.org\/10.1109\/COMST.2017.2665587","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.3837\/tiis.2019.03.010","volume":"13","author":"BL Sun","year":"2019","unstructured":"Sun, B.L., Gui, C., Song, Y., Chen, H.: Network coding-based maximum lifetime algorithm for sliding window in WSNs. KSII Trans. Internet Inf. Syst. 13(3), 1298\u20131310 (2019). https:\/\/doi.org\/10.3837\/tiis.2019.03.010","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Feng, W.Y., Luo, H.W., Sun, B.L., Gui, C.: Performance analysis of sliding window network coding for energy efficient in MANETs. In: 7th IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC 2017), Macau, China, July 21\u201323 2017, pp. 219\u2013222 (2017). https:\/\/doi.org\/10.1109\/ICEIEC.2017.8076548","DOI":"10.1109\/ICEIEC.2017.8076548"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"3139","DOI":"10.1016\/j.jfranklin.2018.12.018","volume":"356","author":"L Trifina","year":"2019","unstructured":"Trifina, L., Tarniceriu, D.: Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers. J. Franklin Inst. 356, 3139\u20133168 (2019). https:\/\/doi.org\/10.1016\/j.jfranklin.2018.12.018","journal-title":"J. Franklin Inst."},{"issue":"9","key":"19_CR10","doi-asserted-by":"publisher","first-page":"5793","DOI":"10.1109\/TIT.2017.2717579","volume":"63","author":"E Nieminen","year":"2017","unstructured":"Nieminen, E.: On quadratic permutation polynomials, turbo codes, and butterfly networks. IEEE Trans. Inf. Theory 63(9), 5793\u20135801 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2717579","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TCSI.2015.2512715","volume":"63","author":"J Wang","year":"2016","unstructured":"Wang, J., Zhang, K., Kr\u00f6ll, H., Wei, J.: Design of QPP interleavers for the parallel turbo decoding architecture. IEEE Trans. Circuits Syst. I Regul. Pap. 63(2), 288\u2013299 (2016). https:\/\/doi.org\/10.1109\/TCSI.2015.2512715","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/JCN.2015.000029","volume":"17","author":"G Wu","year":"2015","unstructured":"Wu, G., Liang, L.P.: Construction of Block-LDPC codes based on quadratic permutation polynomials. J. Commun. Netw. 17(2), 157\u2013161 (2015). https:\/\/doi.org\/10.1109\/JCN.2015.000029","journal-title":"J. Commun. Netw."},{"issue":"16","key":"19_CR13","doi-asserted-by":"publisher","first-page":"3963","DOI":"10.1109\/JLT.2019.2917210","volume":"37","author":"LX Fu","year":"2019","unstructured":"Fu, L.X., Xie, Y.Y., Song, T.T., Su, Y., Chai, J.X., Ye, Y.C., Li, L.L.: Exploring reliable communication in optical networks-on-chip based on all-optical linear block codes encoder. J. Lightwave Technol. 37(16), 3963\u20133971 (2019). https:\/\/doi.org\/10.1109\/JLT.2019.2917210","journal-title":"J. Lightwave Technol."},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11235-016-0166-2","volume":"64","author":"L Trifina","year":"2016","unstructured":"Trifina, L., Tarniceriu, D.: A simple method to determine the number of true different quadratic and cubic permutation polynomial based interleavers for turbo codes. Telecommun. Syst. 64(1), 147\u2013171 (2016). https:\/\/doi.org\/10.1007\/s11235-016-0166-2","journal-title":"Telecommun. Syst."},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/TCOMM.2016.2628744","volume":"65","author":"L Trifina","year":"2017","unstructured":"Trifina, L., Tarniceriu, D.: On the Equivalence of cubic permutation polynomial and ARP interleavers for turbo codes. IEEE Trans. Commun. 65(2), 473\u2013485 (2017). https:\/\/doi.org\/10.1109\/TCOMM.2016.2628744","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1109\/TNET.2015.2427161","volume":"24","author":"P Ostovari","year":"2016","unstructured":"Ostovari, P., Wu, J., Khreishah, A., Shroff, N.B.: Scalable video streaming with helper nodes using random linear network coding. IEEE\/ACM Trans. Networking 24(3), 1574\u20131587 (2016). https:\/\/doi.org\/10.1109\/TNET.2015.2427161","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/JIOT.2017.2703813","volume":"4","author":"S Wunderlich","year":"2017","unstructured":"Wunderlich, S., Cabrera, J.A., Fitzek, F.H.P., Reisslein, M.: Network coding in heterogeneous multicore IoT nodes with DAG scheduling of parallel matrix block operations. IEEE Internet Things J. 4(4), 917\u2013933 (2017). https:\/\/doi.org\/10.1109\/JIOT.2017.2703813","journal-title":"IEEE Internet Things J."},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Yu, M., Sadeghi, P.: Approximating throughput and packet decoding delay in linear network coded wireless broadcast. In: 2018 IEEE Information Theory Workshop (ITW 2018), Guangzhou, China, 25\u201329 November (2018). https:\/\/doi.org\/10.1109\/ITW.2018.8613407","DOI":"10.1109\/ITW.2018.8613407"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Hu, H.F., Liu, M.Y., Yuan, D.M., Ran, J.: A block based encoding approach for improving sliding window network coding in wireless networks. In: 3rd IEEE International Conference on Computer and Communications (ICCC 2017), Chengdu, China, 13\u201316 December, pp. 300\u2013304 (2017). https:\/\/doi.org\/10.1109\/CompComm.2017.8322560","DOI":"10.1109\/CompComm.2017.8322560"},{"issue":"9","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B Waxman","year":"1988","unstructured":"Waxman, B.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617\u20131622 (1988). https:\/\/doi.org\/10.1109\/49.12889","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"19_CR21","unstructured":"The Network Simulator - NS-2. https:\/\/www.isi.edu\/nsnam\/ns\/"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Anonymity in Computation, Communication, and Storage"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68851-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,4]],"date-time":"2021-02-04T07:23:15Z","timestamp":1612423395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68851-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030688509","9783030688516"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68851-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SpaCCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spaccs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.spaccs2020.com\/","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":"131","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":"48","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":"37% - 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":"3","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":"4","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)"}}]}}