On 9/20/05, Matthew Toseland <toad at amphibian.dyndns.org> wrote: > Any ideas for splitfile FEC algorithms apart from the onion code we use > now (vandermonde codes)?
Reed-Solomon codes? They're (iirc) computationally efficient, have flexible settings for redundancy levels, don't care which blocks have errors, and can correct as many missing blocks as there are redundant blocks (or half that number of blocks with errors the decoder doesn't know about). The relevant research was done in the 1960s, so I highly doubt there are patent issues. Evan Daniel
