Skip to content

On Intercept Probability Minimization under Sparse Random Linear Network Coding

Research output: Contribution to journalArticle

Original languageEnglish
Article number8673872
Pages (from-to)6137-6141
Number of pages5
JournalIEEE Transactions on Vehicular Technology
Issue number6
DateAccepted/In press - 21 Mar 2019
DatePublished (current) - 25 Mar 2019


This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of random linear network coding (RLNC). A tight approximation to the probability of the eavesdropper recovering the source message is provided. The proposed approximation applies to both the cases where transmissions occur without feedback, or where the reliability of the feedback channel is impaired by an eavesdropper jamming the feedback channel. An optimization framework for minimizing the intercept probability by optimizing the sparsity of the RLNC is also presented. Results validate the proposed approximation and quantify the gain provided by our optimization over solutions where non-sparse RLNC is used.

    Research areas

  • intercept probability, physical layer security, secrecy outage probability, Sparse random network coding

Download statistics

No data available



  • Full-text PDF (author accepted manuscript)

    Rights statement: This is the author accepted manuscript (AAM). The final published version (version of record) is available online via Institute of Electrical and Electronics Engineers at . Please refer to any applicable terms of use of the publisher.

    Accepted author manuscript, 414 KB, PDF document


View research connections

Related faculties, schools or groups