Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Using Interleaving to Ameliorate the Effects of Packet Loss in a Video Stream
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Differentiated Data Persistence with Priority Random Linear Codes
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Subjective impression of variations in layer encoded videos
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Priority encoding transmission
IEEE Transactions on Information Theory - Part 1
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
Joint source/FEC rate selection for quality-optimal MPEG-2 video delivery
IEEE Transactions on Image Processing
IEEE Transactions on Circuits and Systems for Video Technology
On-the-fly coding for real-time applications
MM '09 Proceedings of the 17th ACM international conference on Multimedia
| Hi-index | 0.02 |
Conventionally, linear block codes designed for packet erasure correction are targeted to recover all the lost source packets per block, when the fraction of lost data is smaller than the redundancy overhead. However, these codes fail to recover any lost packets, if the number of erasures just exceeds the limit for full recovery capability, while it can still be beneficial to recover part of the symbols. In addition, common linear block codes are not well suited for unequal error protection, since different block codes with different rates must be allocated for each priority class separately. These two problems motivate the design of more flexible forward error correction (FEC) codes for media streaming applications. We first review the performance of short and long linear block codes. Long block codes generally offer better error correction capabilities, but at the price of higher complexity and larger coding delay. Short block codes can be more appropriate in media streaming applications that require smooth performance degradation when the channel loss rate increases. We study a new class of linear block codes using sparse generator matrices that permit to optimize the performance of short block codes for partial recovery of the lost packets. In addition, the proposed codes are extended to the design of unequal erasure protection solutions. Simulations of practical video streaming scenarios demonstrate that the flexible sparse codes offer a promising solution with interesting error correction capabilities and small variance in the residual loss rate. They typically represent an effective trade-off between short block codes with limited flexibility, and long block codes with delay penalties.