saturnbingo

In bingo saturnbingo general, an erasure code transforms a message of n blocks, into one with > n blocks such that the original message can be recovered from a subset of those blocks. The fraction of the blocks required is called the rate, denoted r.Optimal erasure codes produce n/r blocks where any n blocks is sufficient to recover the original message. Unfortunately optimal bingo codes are costly and so near optimal erasure codes are often used. These require n blocks saturnbingo to recover the message. Reducing ε can be done at the cost of CPU time.Rateless erasure

codes transform an n block message into a practically infinite encoded form. Encoded symbols can be generated bingo ad infinitum and some number of them is enough to recover the message.ExamplesNear optimal erasure codesOnline codesRaptor codesOptimal saturnbingo erasure codesOptimal erasure codes with arbitrary parameters is surprisingly simple.External links Feclib is a near optimal extention to Luigi Rizzos work that uses band matrices. Many parameters can be set, like the size of the width of the band and size of saturnbingo the finite field. It also sucessfully bingo exploits the large Processor register size of modern CPUs. How it compares to the near optimal codes saturnbingo mentioned above is unknown.Coding theory