Revision as of 18:26, 2 March 2019 edit The mike luby (talk \| contribs) 130 edits m →Legal status: removed slash at end of reference (that was causing it to go the wrong wikipedia page ← Previous edit		Revision as of 18:39, 2 March 2019 edit undo The mike luby (talk \| contribs) 130 edits m →Recovery overhead: tweaks to language to make it clearer Next edit →
Line 38: 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 probability and overhead == The ~~recovery~~ overhead is how many additional encoding symbols beyond the number ''k'' of source symbols in the original source block ~~are~~need to be ~~needed~~ received to ~~reliably~~completely recover the source block. (Based on elementary information theory considerations, complete recovery of a source block with ''k'' source symbols is not possible if less than ''k'' encoding symbols are received.) 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:

Raptor code: Difference between revisions