{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T02:44:19Z","timestamp":1774665859620,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T00:00:00Z","timestamp":1709510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T00:00:00Z","timestamp":1709510400000},"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":["Telecommun Syst"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s11235-024-01110-z","type":"journal-article","created":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T08:02:52Z","timestamp":1709539372000},"page":"83-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Novel compressed linear network coding vectors for multihop communication networks"],"prefix":"10.1007","volume":"86","author":[{"given":"Anas A.","family":"Abudaqa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashraf S. H.","family":"Mahmoud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alawi A.","family":"ALsaggaf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarek R.","family":"Sheltami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,4]]},"reference":[{"issue":"4","key":"1110_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.-Y., & Yeung, R. W. (2000). Network information flow. IEEE Transactions on Information Theory, 46(4), 1204\u20131216.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"1110_CR2","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. W., & Cai, N. (2003). Linear network coding. IEEE Transactions on Information Theory, 49(2), 371\u2013381.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"1110_CR3","doi-asserted-by":"publisher","first-page":"72","DOI":"10.3390\/info9040072","volume":"9","author":"D Vukobratovic","year":"2018","unstructured":"Vukobratovic, D., Tassi, A., Delic, S., & Khirallah, C. (2018). Random linear network coding for 5g mobile video delivery. Information, 9(4), 72.","journal-title":"Information"},{"issue":"8","key":"1110_CR4","doi-asserted-by":"publisher","first-page":"9229","DOI":"10.1109\/TVT.2020.3005409","volume":"69","author":"Y Li","year":"2020","unstructured":"Li, Y., Tang, B., Wang, J., & Bao, Z. (2020). On multi-hop short-packet communications: Recoding or end-to-end fountain coding? IEEE Transactions on Vehicular Technology, 69(8), 9229\u20139233.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"3","key":"1110_CR5","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1109\/TNET.2016.2641680","volume":"25","author":"N Papanikos","year":"2017","unstructured":"Papanikos, N., & Papapetrou, E. (2017). Deterministic broadcasting and random linear network coding in mobile ad hoc networks. IEEE\/ACM Transactions on Networking, 25(3), 1540\u20131554.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1110_CR6","doi-asserted-by":"publisher","first-page":"195240","DOI":"10.1109\/ACCESS.2020.3034191","volume":"8","author":"AA Abudaqa","year":"2020","unstructured":"Abudaqa, A. A., Mahmoud, A., Abu-Amara, M., & Sheltami, T. R. (2020). Super generation network coding for peer-to-peer content distribution networks. IEEE Access, 8, 195240\u2013195252.","journal-title":"IEEE Access"},{"issue":"7","key":"1110_CR7","doi-asserted-by":"publisher","first-page":"2206","DOI":"10.3390\/app10072206","volume":"10","author":"AA AbuDaqa","year":"2020","unstructured":"AbuDaqa, A. A., Mahmoud, A., Abu-Amara, M., & Sheltami, T. (2020). Survey of network coding based p2p file sharing in large scale networks. Applied Sciences, 10(7), 2206.","journal-title":"Applied Sciences"},{"issue":"2","key":"1110_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2422966.2422982","volume":"9","author":"L Keller","year":"2013","unstructured":"Keller, L., Atsan, E., Argyraki, K., & Fragouli, C. (2013). Sensecode: Network coding for reliable sensor networks. ACM Transactions on Sensor Networks (TOSN), 9(2), 1\u201320.","journal-title":"ACM Transactions on Sensor Networks (TOSN)"},{"key":"1110_CR9","doi-asserted-by":"crossref","unstructured":"Jafari, M., Keller, L., Fragouli, C., & Argyraki, K. (2009). Compressed network coding vectors. In 2009 IEEE international symposium on information theory (pp. 109\u2013113). IEEE.","DOI":"10.1109\/ISIT.2009.5206041"},{"key":"1110_CR10","unstructured":"Zhang, Z. (2012). Network coding based on Chinese remainder theorem. arXiv preprint arXiv:1208.3966."},{"key":"1110_CR11","doi-asserted-by":"publisher","first-page":"38416","DOI":"10.1109\/ACCESS.2020.2975761","volume":"8","author":"VA Vasudevan","year":"2020","unstructured":"Vasudevan, V. A., Tselios, C., & Politis, I. (2020). On security against pollution attacks in network coding enabled 5g networks. IEEE Access, 8, 38416\u201338437.","journal-title":"IEEE Access"},{"key":"1110_CR12","doi-asserted-by":"crossref","unstructured":"Lima, L., Vilela, J. P., Barros, J., & M\u00e9dard, M. (2008). An information-theoretic cryptanalysis of network coding-is protecting the code enough? In 2008 International symposium on information theory and its applications (pp. 1\u20136). IEEE.","DOI":"10.1109\/ISITA.2008.4895420"},{"issue":"8","key":"1110_CR13","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/LCOMM.2010.08.092453","volume":"14","author":"S Li","year":"2010","unstructured":"Li, S., & Ramamoorthy, A. (2010). Improved compression of network coding vectors using erasure decoding and list decoding. IEEE Communications Letters, 14(8), 749\u2013751.","journal-title":"IEEE Communications Letters"},{"key":"1110_CR14","doi-asserted-by":"crossref","unstructured":"Guruswami, V. (2003). List decoding with side information. In 18th IEEE annual conference on computational complexity, 2003. Proceedings (pp. 300\u2013309). IEEE.","DOI":"10.1109\/CCC.2003.1214429"},{"key":"1110_CR15","doi-asserted-by":"crossref","unstructured":"Gligoroski, D., Kralevska, K., & \u00d8verby, H. (2015) Minimal header overhead for random linear network coding. In 2015 IEEE international conference on communication workshop (ICCW) (pp. 680\u2013685). IEEE.","DOI":"10.1109\/ICCW.2015.7247260"},{"issue":"7","key":"1110_CR16","doi-asserted-by":"publisher","first-page":"2873","DOI":"10.1109\/TCOMM.2018.2809627","volume":"66","author":"Y Li","year":"2018","unstructured":"Li, Y., Zhang, S., Wang, J., Ji, X., Wu, H., & Bao, Z. (2018). A low-complexity coded transmission scheme over finite-buffer relay links. IEEE Transactions on Communications, 66(7), 2873\u20132887.","journal-title":"IEEE Transactions on Communications"},{"issue":"11","key":"1110_CR17","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1109\/LCOMM.2012.092812.121661","volume":"16","author":"N Thomos","year":"2012","unstructured":"Thomos, N., & Frossard, P. (2012). Toward one symbol network coding vectors. IEEE Communications Letters, 16(11), 1860\u20131863.","journal-title":"IEEE Communications Letters"},{"key":"1110_CR18","doi-asserted-by":"crossref","unstructured":"Chao, C.-C., Chou, C.-C., & Wei, H.-Y. (2010). Pseudo random network coding design for ieee 802.16 m enhanced multicast and broadcast service. In 2010 IEEE 71st vehicular technology conference (pp. 1\u20135). IEEE.","DOI":"10.1109\/VETECS.2010.5493836"},{"key":"1110_CR19","doi-asserted-by":"crossref","unstructured":"Yazdani, N., & Lucani, D. E. (2019). Revolving codes: High performance and low overhead network coding. In 2019 IEEE 2nd wireless Africa conference (WAC) (pp. 1\u20135). IEEE.","DOI":"10.1109\/AFRICA.2019.8843415"},{"key":"1110_CR20","doi-asserted-by":"crossref","unstructured":"Lima, L., M\u00e9dard, M., & Barros, J. (2007). Random linear network coding: A free cipher? In 2007 IEEE international symposium on information theory (pp. 546\u2013550). IEEE.","DOI":"10.1109\/ISIT.2007.4557282"},{"key":"1110_CR21","unstructured":"Pei, D., Salomaa, A., & Ding, C. (1996). Chinese remainder theorem: Applications in computing, coding, cryptography. World Scientific."},{"key":"1110_CR22","unstructured":"Rosen, K. H. (2011). Elementary number theory. Pearson Education."},{"key":"1110_CR23","doi-asserted-by":"crossref","unstructured":"Pedersen, M. V., Heide, J., & Fitzek, F. H. (2011). Kodo: An open and research oriented network coding library. In International conference on research in networking (pp. 145\u2013152). Springer.","DOI":"10.1007\/978-3-642-23041-7_15"},{"key":"1110_CR24","doi-asserted-by":"crossref","unstructured":"Vilela, J. P., Lima, L., & Barros, J. (2008). Lightweight security for network coding. In 2008 IEEE international conference on communications (pp. 1750\u20131754). IEEE.","DOI":"10.1109\/ICC.2008.336"},{"key":"1110_CR25","doi-asserted-by":"crossref","unstructured":"Heide, J., Pedersen, M. V., Fitzek, F. H., & M\u00e9dard, M. (2011). On code parameters and coding vector representation for practical RLNC. In 2011 IEEE international conference on communications (ICC) (pp. 1\u20135). IEEE.","DOI":"10.1109\/icc.2011.5963013"},{"key":"1110_CR26","doi-asserted-by":"crossref","unstructured":"Alperin, J. L., & Bell, R. B. (1995). The general linear group. In Groups and representations (pp. 39\u201362). Springer.","DOI":"10.1007\/978-1-4612-0799-3_2"},{"key":"1110_CR27","doi-asserted-by":"crossref","unstructured":"Qaisar, M. U. F., Wang, X., Hawbani, A., Khan, A., Ahmed, A., Wedaj, F. T., & Ullah, S. (2022). Toras: Trustworthy load-balanced opportunistic routing for asynchronous duty-cycled wsns. IEEE Systems Journal.","DOI":"10.1109\/JSYST.2022.3221096"},{"key":"1110_CR28","unstructured":"Ergen, S. C. (2004). Zigbee\/ieee 802.15. 4 summary. UC Berkeley, 10(17), 11."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01110-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-024-01110-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01110-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T11:14:27Z","timestamp":1716808467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-024-01110-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,4]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1110"],"URL":"https:\/\/doi.org\/10.1007\/s11235-024-01110-z","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,4]]},"assertion":[{"value":"27 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}