A Lower Bound on the Success Probability of Binary Random Linear Network Codes Aided by Noise Decoding
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 (GR...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Open Journal of the Communications Society |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/11026088/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|