Rights statement: Copyright (c) 2025 IEEE. Personal use of this material is permitted. However, permission to use this material for any other purposes must be obtained from the IEEE by sending a request to pubs-permissions@ieee.org.
Accepted author manuscript, 850 KB, PDF document
Available under license: CC BY: Creative Commons Attribution 4.0 International License
Final published version
Licence: CC BY: Creative Commons Attribution 4.0 International License
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - A lower bound on the success probability of binary random linear network codes aided by noise decoding
AU - Chatzigeorgiou, Ioannis
PY - 2025/6/26
Y1 - 2025/6/26
N2 - The decoding of binary random linear codes for packet erasures relies on receivers collecting a sufficient number of error-free coded packets for the reconstruction of a transmitted message. Syndrome decoding (SD), which conforms to the broad definition of guessing random additive noise decoding (GRAND), endeavors to repair partially-correct received coded packets – which would otherwise be discarded by the packet erasure decoder – and boost the probability of a receiver successfully recovering the transmitted message. This paper introduces a low-complexity variant of SD, dubbed single-error correcting SD (SEC-SD), and conducts an in-depth analysis of the success probability of packet erasure decoding aided by SEC-SD. The analysis leads to a practical lower bound on the success probability of packet erasure decoding complemented by SD, and provides guidance on how SEC-SD can be modified to potentially achieve a higher success probability than SD at a lower computational cost.
AB - The decoding of binary random linear codes for packet erasures relies on receivers collecting a sufficient number of error-free coded packets for the reconstruction of a transmitted message. Syndrome decoding (SD), which conforms to the broad definition of guessing random additive noise decoding (GRAND), endeavors to repair partially-correct received coded packets – which would otherwise be discarded by the packet erasure decoder – and boost the probability of a receiver successfully recovering the transmitted message. This paper introduces a low-complexity variant of SD, dubbed single-error correcting SD (SEC-SD), and conducts an in-depth analysis of the success probability of packet erasure decoding aided by SEC-SD. The analysis leads to a practical lower bound on the success probability of packet erasure decoding complemented by SD, and provides guidance on how SEC-SD can be modified to potentially achieve a higher success probability than SD at a lower computational cost.
KW - network coding
KW - linear codes
KW - error analysis
KW - decoding probability
KW - guessing random additive noise decoding (GRAND)
KW - syndrome
U2 - 10.1109/OJCOMS.2025.3577007
DO - 10.1109/OJCOMS.2025.3577007
M3 - Journal article
VL - 6
SP - 4962
EP - 4977
JO - IEEE Open Journal of the Communications Society
JF - IEEE Open Journal of the Communications Society
SN - 2644-125X
ER -