EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On GRAND-Assisted Vector Random Linear Network Coding in Wireless Broadcasts

Rina Su iD, Chengji Zhao, Qifu Sun iD, Linqi Song

Entropy · 15.04.2026 · 28 (4) · 450

DOI: 10.3390/e28040450 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 15.04.2026. Verfasst von Rina Su und 3 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China. Die Arbeit nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

Stichwörter der Autor:innen

completion delayguessing random additive noise decodingrandom linear network codingsyndrome decodingvector linear network codingwireless broadcasts

Autor:innen und Institutionen

  • School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China.
  • Department of Computer Science, City University of Hong Kong, Hong Kong.
  • City University of Hong Kong Shenzhen Research Institute, Shenzhen 518057, China.

ORCID-Profile: Rina Su, Qifu Sun

Förderung

  • National Natural Science Foundation of China
  • Fundamental Research Funds for the Central Universities

Zitieren

APA

Su, R., Zhao, C., Sun, Q., & Song, L. (2026). On GRAND-Assisted Vector Random Linear Network Coding in Wireless Broadcasts. Entropy, 28(4), 450. https://doi.org/10.3390/e28040450

Vancouver

Su R, Zhao C, Sun Q, Song L. On GRAND-Assisted Vector Random Linear Network Coding in Wireless Broadcasts. Entropy. 2026;28(4):450. doi:10.3390/e28040450

BibTeX
@article{Su2026,
  author = {Su, Rina and Zhao, Chengji and Sun, Qifu and Song, Linqi},
  title = {On GRAND-Assisted Vector Random Linear Network Coding in Wireless Broadcasts},
  journal = {Entropy},
  year = {2026},
  volume = {28},
  number = {4},
  pages = {450},
  doi = {10.3390/e28040450}
}
Kostenlos starten →