Revision as of 17:37, 2 March 2019 edit The mike luby (talk \| contribs) 130 edits m changed Legal complexity to legal status ← Previous edit		Revision as of 17:58, 2 March 2019 edit undo The mike luby (talk \| contribs) 130 edits Added section on recovery overhead Next edit →
Line 37: Raptor codes require ''O(1)'' time to generate an encoding symbol. Decoding a message of length ''k'' with a belief propagation decoding algorithm requires ''O(k)'' time for the appropriate choice of inner/outer codes. == Recovery overhead == The recovery overhead is how many additional symbols beyond the number ''k'' of source symbols in the original source block are needed to reliably recover the source block. The recovery probability is the probability that the source block is completely recovered upon receiving a given number of random encoding symbols generated from the source block. The RaptorQ code specified in [[IETF]] RFC 6330 has the following trade-off between recovery probability and recovery overhead: * Greater than 99% recovery probability with overhead of 0 symbols (recovery from ''k'' received encoding symbols). * Greater than 99.99% recovery probability with overhead of 1 symbol (recovery from ''k+1'' received encoding symbols). * Greater than 99.9999% recovery probability with overhead of 2 symbols (recovery from ''k+2'' received encoding symbols). These statements hold for the entire range of ''k'' supported in [[IETF]] RFC 6330, i.e., ''k''=1,...,56403. See [[IETF]] RFC 6330 for more details. == Legal status ==

Raptor code: Difference between revisions