Improved Performance Bounds for Finite- Block-Length Network Coded Systems with Polluted Packet Recycling

Abstract

Packet recycling was recently introduced as an effective technique to counter the packet pollution attack to network coded systems. In this letter, we derive some improved upper and lower bounds on the detection error probability, decoding error probability, and the throughput of a finite-block-length network coded system with polluted packet recycling. By providing accurate performance estimates even for small block lengths (e.g., 100 bits), the new bounds rigorously justify the effectiveness of the packet recycling technique over the traditional cryptographic technique. They can also serve as a guideline for choosing parameters (e.g., code rates and the maximum number of packets to be combined) in preliminary system designs.