{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:34:54Z","timestamp":1760243694886,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T00:00:00Z","timestamp":1666396800000},"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":["62101028","62271044","2021TQ0031","TC20211126644","20222910016"],"award-info":[{"award-number":["62101028","62271044","2021TQ0031","TC20211126644","20222910016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["62101028","62271044","2021TQ0031","TC20211126644","20222910016"],"award-info":[{"award-number":["62101028","62271044","2021TQ0031","TC20211126644","20222910016"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Huawei","award":["62101028","62271044","2021TQ0031","TC20211126644","20222910016"],"award-info":[{"award-number":["62101028","62271044","2021TQ0031","TC20211126644","20222910016"]}]},{"name":"China Telecom","award":["62101028","62271044","2021TQ0031","TC20211126644","20222910016"],"award-info":[{"award-number":["62101028","62271044","2021TQ0031","TC20211126644","20222910016"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In complex network environments, there always exist heterogeneous devices with different computational powers. In this work, we propose a novel scalable random linear network coding (RLNC) framework based on embedded fields, so as to endow heterogeneous receivers with different decoding capabilities. In this framework, the source linearly combines the original packets over embedded fields based on a precoding matrix and then encodes the precoded packets over GF(2) before transmission to the network. After justifying the arithmetic compatibility over different finite fields in the encoding process, we derive a sufficient and necessary condition for decodability over different fields. Moreover, we theoretically study the construction of an optimal precoding matrix in terms of decodability. The numerical analysis in classical wireless broadcast networks illustrates that the proposed scalable RLNC not only guarantees a better decoding compatibility over different fields compared with classical RLNC over a single field, but also outperforms Fulcrum RLNC in terms of a better decoding performance over GF(2). Moreover, we take the sparsity of the received binary coding vector into consideration, and demonstrate that for a large enough batch size, this sparsity does not affect the completion delay performance much in a wireless broadcast network.<\/jats:p>","DOI":"10.3390\/e24111510","type":"journal-article","created":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T02:31:03Z","timestamp":1666578663000},"page":"1510","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Network Coding for Heterogeneous Devices over Embedded Fields"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7248-5500","authenticated-orcid":false,"given":"Hanqi","family":"Tang","sequence":"first","affiliation":[{"name":"Department of Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruobin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Network Technology Lab, Huawei Technologies Co., Ltd., Shenzhen 518000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[{"name":"Institute for Network Sciences and Cyberspace, Tsinghua University, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keping","family":"Long","sequence":"additional","affiliation":[{"name":"Department of Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3213-1569","authenticated-orcid":false,"given":"Qifu","family":"Sun","sequence":"additional","affiliation":[{"name":"Department of Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","article-title":"A random linear network coding approach to multicast network","volume":"52","author":"Ho","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/MNET.2017.1700063","article-title":"Network coding in relay-based device-to-device communications","volume":"31","author":"Huang","year":"2017","journal-title":"IEEE Netw."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TWC.2010.02.081057","article-title":"Toward network coding-based protocols for data broadcasting in wireless ad hoc networks","volume":"9","author":"Asterjadhi","year":"2010","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_4","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_5","doi-asserted-by":"crossref","first-page":"5511","DOI":"10.1109\/TIT.2008.2006454","article-title":"On the delay and throughput gains of coding in unreliable networks","volume":"54","author":"Eryilmaz","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"6328","DOI":"10.1109\/TIT.2013.2271895","article-title":"Throughput-delay analysis of random linear network coding for wireless broadcasting","volume":"59","author":"Swapna","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Zhu, H., and Ouahada, K. (2018). Investigating random linear coding from a pricing perspective. Entropy, 20.","DOI":"10.3390\/e20080548"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/JIOT.2017.2703813","article-title":"Network coding in heterogeneous multicore IoT nodes with DAG scheduling of parallel matrix block operations","volume":"4","author":"Wunderlich","year":"2017","journal-title":"IEEE Internet Things J."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Heide, J., and Lucani, D.E. (2015, January 8\u201312). Composite extension finite fields for low overhead Network Coding: Telescopic codes. Proceedings of the 2015 IEEE International Conference on Communications (ICC), London, UK.","DOI":"10.1109\/ICC.2015.7249032"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Marcano, N.J.H., Heide, J., Lucani, D.E., and Fitzek, F.H. (2015, January 6\u20139). On the overhead of telescopic codes in network coded cooperation. Proceedings of the 2015 IEEE 82nd Vehicular Technology Conference (VTC2015-Fall), Boston, MA, USA.","DOI":"10.1109\/VTCFall.2015.7391046"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Heide, J. (2016, January 22\u201327). Composite extension finite fields for distributed storage erasure coding. Proceedings of the 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ICC.2016.7510828"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/LCOMM.2020.3027875","article-title":"Revolving codes: Overhead and computational complexity analysis","volume":"25","author":"Yazdani","year":"2021","journal-title":"IEEE Commu. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"77890","DOI":"10.1109\/ACCESS.2018.2884408","article-title":"Fulcrum: Flexible network coding for heterogeneous devices","volume":"6","author":"Lucani","year":"2018","journal-title":"IEEE Access"},{"key":"ref_14","first-page":"78239","article-title":"DSEP Fulcrum: Dynamic sparsity and expansion packets for fulcrum network coding","volume":"8","author":"Nguyen","year":"2020","journal-title":"IEEE Access"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Lidl, R., and Niederreiter, H. (1997). Finite Fields, Cambridge University Press. [3rd ed.].","DOI":"10.1017\/CBO9780511525926"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Schutz, B., and Aschenbruck, N. (2019, January 14\u201317). Packet-preserving network coding schemes for padding overhead reduction. Proceedings of the 2019 IEEE 44th Conference on Local Computer Networks (LCN), Osnabrueck, Germany.","DOI":"10.1109\/LCN44214.2019.8990879"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/TBC.2019.2892594","article-title":"Reduction of padding overhead for RLNC media distribution with variable size packets","volume":"65","author":"Taghouti","year":"2019","journal-title":"IEEE Trans. Broadcast."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/TIT.2018.2832624","article-title":"Circular-shift linear network coding","volume":"65","author":"Tang","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3053","DOI":"10.1109\/TIT.2016.2553670","article-title":"BASIC codes: Low-complexity regenerating codes for distributed storage systems","volume":"62","author":"Hou","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Feizi, S., Lucani, D.E., S\u00f8rensen, C.W., Makhdoumi, A., and M\u00e9dard, M. (2014, January 27\u201328). Tunable Sparse Network Coding for Multicast Networks. Proceedings of the 2014 IEEE International Symposium on Network Coding (NetCod), Aalborg Oest, Denmark.","DOI":"10.1109\/NETCOD.2014.6892129"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.comcom.2022.01.004","article-title":"Lightweight network-coded ARQ: An approach for ultra-reliable low latency communication","volume":"185","author":"Karetsi","year":"2022","journal-title":"Comput. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Ma, S., Liu, X., Yan, Y., Zhang, B., and Zheng, J. (2020, January 15\u201319). Sliding-window based batch forwarding using intra-flow random linear network coding. Proceedings of the 2020 International Wireless Communications and Mobile Computing (IWCMC), Limassol, Cyprus.","DOI":"10.1109\/IWCMC48107.2020.9148322"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"54276","DOI":"10.1109\/ACCESS.2022.3175815","article-title":"FSW: Fulcrum sliding window coding for low-latency communication","volume":"10","author":"Tasdemir","year":"2022","journal-title":"IEEE Access"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Tang, H., Zheng, R., Li, Z., and Sun, Q.T. (2021, January 28\u201330). Scalable Network Coding over Embedded Fields. Proceedings of the 2021 IEEE\/CIC International Conference on Communications in China (ICCC), Xiamen, China.","DOI":"10.1109\/ICCC52777.2021.9580416"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/11\/1510\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:00:52Z","timestamp":1760144452000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/11\/1510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,22]]},"references-count":24,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["e24111510"],"URL":"https:\/\/doi.org\/10.3390\/e24111510","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,10,22]]}}}