On Vector Random Linear Network Coding in Wireless Broadcasts

On Vector Random Linear Network Coding in Wireless Broadcasts

Compared with scalar linear network coding (LNC) formulated over the finite field GF(<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>2</mn><mi>L</mi></msup></semantics&...

Full description

Saved in:
Bibliographic Details
Main Authors: Rina Su, Chengji Zhao, Qifu Sun, Zhongshan Zhang
Format: Article
Language:English
Published: MDPI AG 2025-05-01
Series:Entropy
Subjects:
random linear network coding (RLNC)
vector linear network coding (VLNC)
completion delay
wireless broadcast
Online Access:https://www.mdpi.com/1099-4300/27/6/559
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Compared with scalar linear network coding (LNC) formulated over the finite field GF(<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>2</mn><mi>L</mi></msup></semantics></math></inline-formula>), vector LNC offers enhanced flexibility in the code design by enabling linear operations over the vector space <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>GF</mi><msup><mrow><mo>(</mo><mn>2</mn><mo>)</mo></mrow><mi>L</mi></msup></mrow></semantics></math></inline-formula> and demonstrates a number of advantages over scalar LNC. While random LNC (RLNC) has shown significant potential to improve the completion delay performance in wireless broadcasts, most prior studies focus on scalar RLNC. In particular, it is well known that, with increasing <i>L</i>, primitive scalar RLNC over GF(<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>2</mn><mi>L</mi></msup></semantics></math></inline-formula>) asymptotically achieves the optimal completion delay. However, the completion delay performance of primitive vector RLNC remains unexplored. This work aims to fill in this blank. We derive closed-form expressions for the probability distribution and the expected value of both the completion delay at a single receiver and the system completion delay. We further unveil a fundamental limitation that is different from scalar RLNC: even for large enough <i>L</i>, primitive vector RLNC over <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>GF</mi><msup><mrow><mo>(</mo><mn>2</mn><mo>)</mo></mrow><mi>L</mi></msup></mrow></semantics></math></inline-formula> inherently fails to reach optimal completion delay. In spite of this, the gap between the expected completion delay at a receiver and the optimal one is shown to be a constant smaller than <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0.714</mn></mrow></semantics></math></inline-formula>, which implies that the expected completion delay normalized by the number <i>P</i> of original packets is asymptotically optimal with increasing <i>P</i>. We also validate our theoretical characterization through numerical simulations. Our theoretical characterization establishes primitive vector RLNC as a performance baseline for the future design of practical vector RLNC schemes with different design goals.
ISSN:1099-4300

Similar Items