{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:32:47Z","timestamp":1743096767705,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"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_54","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T12:41:31Z","timestamp":1557146491000},"page":"576-586","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Minimizing Decoding Complexity for Binary Linear Network Codes"],"prefix":"10.1007","author":[{"given":"Jian","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,7]]},"reference":[{"issue":"2","key":"54_CR1","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S-Y Li","year":"2003","unstructured":"Li, S.-Y., Yeung, R.R.W., Cai, N.: Linear network coding. IEEE Trans. Inf. Theory 49(2), 371\u2013381 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"54_CR2","unstructured":"Luby, M.: LT codes. In: Proceedings 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 271\u2013282 (2002)"},{"issue":"6","key":"54_CR3","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theory 52(6), 2551\u20132567 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"54_CR4","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"Ho, T., et al.: A random linear network coding approach to multicast. IEEE Trans. Inf. Theory 52(10), 4413\u20134430 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"54_CR5","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1109\/TIT.2016.2536612","volume":"62","author":"CW Sung","year":"2016","unstructured":"Sung, C.W., Shum, K.W., Huang, L., Kwan, H.Y.: Linear network coding for erasure broadcast channel with feedback: complexity and algorithms. IEEE Trans. Inf. Theory 62(5), 2493\u20132503 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/LWC.2018.2830361","volume":"7","author":"J Wang","year":"2018","unstructured":"Wang, J., Xu, K., Xu, Y., Zhang, D., Zhu, Y.: Pseudo-systematic decoding of hybrid instantly decodable network code for wireless broadcasting. IEEE Wirel. Commun. Lett. 7, 840\u2013843 (2018)","journal-title":"IEEE Wirel. Commun. Lett."},{"issue":"1","key":"54_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TCOMM.2015.2503398","volume":"64","author":"A Tassi","year":"2016","unstructured":"Tassi, A., Chatzigeorgiou, I., Lucani, D.E.: Analysis and optimization of sparse random linear network coding for reliable multicast services. IEEE Trans. Commun. 64(1), 285\u2013299 (2016)","journal-title":"IEEE Trans. Commun."},{"key":"54_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-54522-0_93","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"E Kaltofen","year":"1991","unstructured":"Kaltofen, E., David Saunders, B.: On Wiedemann\u2019s method of solving sparse linear systems. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds.) AAECC 1991. LNCS, vol. 539, pp. 29\u201338. Springer, Heidelberg (1991). \n                    https:\/\/doi.org\/10.1007\/3-540-54522-0_93"},{"key":"54_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0024-3795(93)90235-G","volume":"192","author":"D Coppersmith","year":"1993","unstructured":"Coppersmith, D.: Solving linear equations over GF(2): block Lanczos algorithm. Linear Algebra Appl. 192, 33\u201360 (1993)","journal-title":"Linear Algebra Appl."},{"key":"54_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-23041-7_13","volume-title":"NETWORKING 2011 Workshops","author":"J Heide","year":"2011","unstructured":"Heide, J., Pedersen, M.V., Fitzek, F.H.P.: Decoding algorithms for random linear network codes. In: Casares-Giner, V., Manzoni, P., Pont, A. (eds.) NETWORKING 2011. LNCS, vol. 6827, pp. 129\u2013136. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-23041-7_13"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Feizi, S., Lucani, D., S\u00f8rensen, C., Makhdoumi, A., M\u00e9dard, M.: Tunable sparse network coding for multicast networks. In: Proceedings of the International Symposium on Network Coding Coding (NetCod 2014), Aalborg, Denmark, pp. 1\u20136 (2014)","DOI":"10.1109\/NETCOD.2014.6892129"},{"key":"54_CR12","unstructured":"Kwon, J., Park, H.: Low complexity algorithms for network coding based on singular value decomposition. In: IEEE 2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN), pp. 641\u2013643 (2016)"},{"key":"54_CR13","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1109\/TNET.2014.2338053","volume":"23","author":"S Sorour","year":"2015","unstructured":"Sorour, S., Valaee, S.: Completion delay minimization for instantly decodable network codes. IEEE\/ACM Trans. Netw. (TON) 23, 1553\u20131567 (2015)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1073\/pnas.42.10.767","volume":"42","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: Dynamic programming and lagrange multipliers. Proc. Natl. Acad. Sci. 42, 767\u2013769 (1956)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"54_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"PL Hammer","year":"2012","unstructured":"Hammer, P.L., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas, vol. 7. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-85823-9"}],"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_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:34:14Z","timestamp":1558402454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19156-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030191559","9783030191566"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19156-6_54","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"}}]}}