{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T14:30:47Z","timestamp":1781533847348,"version":"3.54.5"},"reference-count":30,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T00:00:00Z","timestamp":1776211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62401048"],"award-info":[{"award-number":["62401048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271044"],"award-info":[{"award-number":["62271044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371411"],"award-info":[{"award-number":["62371411"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"award":["62401048"],"award-info":[{"award-number":["62401048"]}],"id":[{"id":"https:\/\/ror.org\/01h0zpd94","id-type":"ROR","asserted-by":"publisher"}]},{"award":["62271044"],"award-info":[{"award-number":["62271044"]}],"id":[{"id":"https:\/\/ror.org\/01h0zpd94","id-type":"ROR","asserted-by":"publisher"}]},{"award":["62371411"],"award-info":[{"award-number":["62371411"]}],"id":[{"id":"https:\/\/ror.org\/01h0zpd94","id-type":"ROR","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["FRF-TP-26-071"],"award-info":[{"award-number":["FRF-TP-26-071"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Recent works have combined random linear network coding (RLNC) with guessing random additive noise decoding (GRAND) to leverage RLNC packets to partially correct bit errors prior to RLNC decoding, so as to reduce the packet erasure rates in wireless broadcast networks. However, existing schemes are restricted to scalar RLNC over the finite field GF(2L). In this paper, we first formulate a general GRAND-assisted decoding framework for vector RLNC over the vector space GF(2)L, and further propose a design rule for vector RLNC schemes such that estimated error vectors can be efficiently obtained without incurring any additional computational overhead. Necessary and sufficient conditions for the correctness of every efficiently obtained estimated error vector are characterized. Two explicit vector RLNC schemes satisfying the proposed design rule are constructed. The first scheme is designed based on the matrix representation of GF(2L), and analytical results show that it achieves the same completion delay performance as the counterpart scalar RLNC scheme over GF(2L), while achieving up to a 37.3% reduction in coding computational complexity compared with the scalar one. The second scheme is designed based on sparse coding coefficient matrices. It further reduces computational complexity by up to 33.6% compared with the first scheme, at the cost of a slight degradation in completion delay performance.<\/jats:p>","DOI":"10.3390\/e28040450","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T10:30:23Z","timestamp":1776249023000},"page":"450","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On GRAND-Assisted Vector Random Linear Network Coding in Wireless Broadcasts"],"prefix":"10.3390","volume":"28","author":[{"given":"Rina","family":"Su","sequence":"first","affiliation":[{"name":"School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengji","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3213-1569","authenticated-orcid":false,"given":"Qifu","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Linqi","family":"Song","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong"},{"name":"City University of Hong Kong Shenzhen Research Institute, Shenzhen 518057, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"ref_1","unstructured":"Medard, M., Effros, M., Karger, D., and Ho, T. (2003, January 1\u20133). On coding for non-multicast networks. Proceedings of the Annual Allerton Conference, Monticello, IL, USA."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1109\/TIT.2010.2094930","article-title":"Algebraic algorithms for vector network coding","volume":"57","author":"Ebrahimi","year":"2011","journal-title":"IEEE Trans. Inf. Theory."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1701","DOI":"10.1109\/LCOMM.2016.2583418","article-title":"On the message dimensions of vector linearly solvable networks","volume":"20","author":"Das","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/TIT.2017.2697422","article-title":"Linear network coding over rings Part II: Vector codes and non-commutative alphabets","volume":"64","author":"Connelly","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"7408","DOI":"10.1109\/TIT.2020.3014054","article-title":"Characteristic sets of fixed-dimension vector linear codes for non-multicast networks","volume":"66","author":"Das","year":"2020","journal-title":"IEEE Trans. Inf. Theory."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"5096","DOI":"10.1109\/TCOMM.2016.2613085","article-title":"On vector linear solvability of multicast networks","volume":"64","author":"Sun","year":"2016","journal-title":"IEEE Trans. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2460","DOI":"10.1109\/TIT.2018.2797183","article-title":"Vector network coding based on subspace codes outperforms scalar linear network coding","volume":"64","author":"Etzion","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"6786","DOI":"10.1109\/TIT.2020.2995845","article-title":"Network-coding solutions for minimal combination networks and their sub-networks","volume":"66","author":"Cai","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"5580","DOI":"10.1109\/TIT.2021.3065364","article-title":"On the gap between scalar and vector solutions of generalized combination networks","volume":"67","author":"Liu","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"5533","DOI":"10.1109\/TIT.2024.3418471","article-title":"Bounds on the minimum field size of network MDS codes","volume":"70","author":"Wei","year":"2024","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","unstructured":"Plank, J.S., Simmerman, S., and Schuman, C.D. (2008). Jerasure: A Library in c\/c++ Facilitating Erasure Coding for Storage Applications, University of Tennessee. Technical Report."},{"key":"ref_12","unstructured":"(2026, March 01). Intel(R) Intelligent Storage Acceleration Library, Version 2.31.1. Available online: https:\/\/github.com\/intel\/isa-l."},{"key":"ref_13","unstructured":"(2026, March 01). Longhair: Fast Cauchy Reed-Solomon Erasure Codes in C. Available online: https:\/\/github.com\/catid\/longhair."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","article-title":"A random linear network coding approach to multicast","volume":"52","author":"Ho","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1109\/TIT.2011.2177562","article-title":"On coding for delay\u2014 Network coding for time-division duplexing","volume":"58","author":"Lucani","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5538","DOI":"10.1109\/TIT.2016.2537837","article-title":"Opportunistic scheduling of randomly coded multicast transmissions at half-duplex relay stations","volume":"62","author":"Chen","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/LWC.2018.2881157","article-title":"On optimizing effective rate for random linear network coding over burst-erasure relay links","volume":"8","author":"Wu","year":"2019","journal-title":"IEEE Wireless Commun. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"5606","DOI":"10.1109\/TCOMM.2020.3001133","article-title":"Delay-complexity trade-off of random linear network coding in wireless broadcast","volume":"68","author":"Su","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3963","DOI":"10.1109\/TWC.2020.2979145","article-title":"On data dissemination enhanced by network coded device-to-device communications","volume":"19","author":"Li","year":"2020","journal-title":"IEEE Trans. Wireless Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"24","DOI":"10.23919\/JCC.2021.06.003","article-title":"On latency reductions in vehicle-to-vehicle networks by random linear network coding","volume":"18","author":"Zhu","year":"2021","journal-title":"China Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"7843","DOI":"10.1109\/TCOMM.2022.3220867","article-title":"Completion delay of random linear network coding in full-duplex relay networks","volume":"70","author":"Su","year":"2022","journal-title":"IEEE Trans. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2734","DOI":"10.1109\/TVT.2022.3211880","article-title":"On the buffer size of perfect RLNC in full-duplex relay networks","volume":"72","author":"Su","year":"2023","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Tang, H., Liu, H., Jin, S., Liu, W., and Sun, Q. (2024). On matrix representation of extension field GF(pL) and its application in vector linear network coding. Entropy, 26.","DOI":"10.3390\/e26100822"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"12842","DOI":"10.1109\/TVT.2024.3383546","article-title":"Guessing random additive noise decoding of network coded data transmitted over burst error channels","volume":"73","author":"Chatzigeorgiou","year":"2024","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4962","DOI":"10.1109\/OJCOMS.2025.3577007","article-title":"A lower bound on the success probability of binary random linear network codes aided by noise decoding","volume":"6","author":"Chatzigeorgiou","year":"2025","journal-title":"IEEE Open J. Commun. Soc."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1952","DOI":"10.1109\/TCOMM.2025.3631721","article-title":"GRAND-assisted random linear network coding in wireless broadcasts","volume":"74","author":"Su","year":"2026","journal-title":"IEEE Trans. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Duffy, K.R., Li, J., and M\u00e9dard, M. (2018, January 17\u201322). Guessing noise, not code-words. Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437648"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"4023","DOI":"10.1109\/TIT.2019.2896110","article-title":"Capacity-achieving guessing random additive noise decoding","volume":"65","author":"Duffy","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2830","DOI":"10.1109\/TIT.2022.3230782","article-title":"ORBGRAND is almost capacity-acheiving","volume":"69","author":"Liu","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1080\/0025570X.1994.11996233","article-title":"Matrix representation of finite fields","volume":"67","author":"Wardlaw","year":"1994","journal-title":"Math. Mag."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/4\/450\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:24:45Z","timestamp":1776399885000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/4\/450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,15]]},"references-count":30,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["e28040450"],"URL":"https:\/\/doi.org\/10.3390\/e28040450","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,15]]}}}