Code and codec performance
This page gives some information on the expected performance in terms of erasure recovery. For the moment it is limited to LDPC-Staircase codes.
Testing conditions:
- LDPC-Staircase codec;
- k=1024 symbols, encoded as a single source block (NB: the symbol size does not matter for erasure recovery performance evaluation);
- symbol transmission order is fully random (NB: results only depend on the average loss rate, no matter whether they happen in bursts or not);
- evaluated using the openfec integrated performance evaluation tools;
Result summary
Results are excellent and approach that of an ideal code where the overhead is 0. The details are given in the curves below, and one can see that if an error floor is still visible when using N1=5, it is no longer visible (i.e., if any is below 10-5) with N1=7. Note that higher values of N1 can still be used if needed...
Erasure recovery performance as a function of the overhead

This curve indicates the probability decoding fails as a function of the overhead (said differently the number of symbols received). Here code rate=2/3; N1=5 or 7.
(NB: don't be fooled by the horizontal scale, an extra 40 symbols only represents a 3.9% overhead when dealing with k=1024. This curve is therefore a close-up.)
(NB2: on the left of the vertical line, no decoding is possible since fewer than k symbols have been received)

Same conditions as above for code rate=1/2.
Erasure recovery performance as a function of the channel loss rate
(nb: this is a different view of the same results, the number of symbols actually erased corresponding to a certain loss rate)

This curve indicates the probability decoding fails as a function of the loss rate (said differently the number of symbols received/n). Here code rate=2/3; N1=5 or 7.
(NB: on the right of the vertical line, no decoding is possible since fewer than k symbols have been received)

Same conditions as above for code rate=1/2.