.png){kind=icon}
.png){kind=icon}
Return
Rethinking the Intercept Probability of Random Linear Network Coding
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2015.2470662.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded packets, and an eavesdropper. Closed-form expressions for the probability of the eavesdropper intercepting enough coded packets to recover the message are derived. Transmission with and without feedback is studied. Furthermore, an optimization model that minimizes the intercept probability under delay and reliability constraints is presented. Results validate the proposed analysis and quantify the secrecy gain offered by a feedback link from the legitimate receiver.
Keywords:
Network coding
fountain coding
physical layer security
secrecy outage probability
intercept probability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W