https://web.archive.org/web/20170217014803/http://freearc.org/
I heard that BitTorrent is 40% traffic of today Internet
I personally prefer Nim. there is also Zig and D.
if they will need that, they will find a method long ago. but they try to minimize amount of data read/written for every transaction. look up for example "pyramid codes" - it's a way to use 20 disks in raid system but…
among the great answers that was already written here, i can suggest famous Plank tutorial: https://web.eecs.utk.edu/~plank/plank/papers/CS-96-332.html i (FastECC author) learned everything from this great text. It…
short answer: they all are suitable. i even has (unfinished) ldpc-based program that is pretty similar to par2 long answer: what you need is Forward Error Correction, that is implemented by any Error-Correcting Code…
the math behind it is completely different. it doesn't even use GF(2^n) fields at all :) as mentioned in RS.md, the encoding sheme is known since 2003 and even became a part of RFC
Well, it's MY code so i use term "block" in the same meaning as they use term "shard" :)
by block i mean the same thing as they mean by shard. it just doesn't make sense to count entire amount of data processed - only amount of data processed TOGETHER make a sense and yeah, it's quite hard to believe that…
Speed of RS coder depends on the amount of data/parity blocks. From the URL you mentioned, speed with 50+20 blocks is 713 MB/s. This algorithms is O(N^2) that means the speed is proportional to 1/N. So if it will…
I heard that BitTorrent is 40% traffic of today Internet
I personally prefer Nim. there is also Zig and D.
if they will need that, they will find a method long ago. but they try to minimize amount of data read/written for every transaction. look up for example "pyramid codes" - it's a way to use 20 disks in raid system but…
among the great answers that was already written here, i can suggest famous Plank tutorial: https://web.eecs.utk.edu/~plank/plank/papers/CS-96-332.html i (FastECC author) learned everything from this great text. It…
short answer: they all are suitable. i even has (unfinished) ldpc-based program that is pretty similar to par2 long answer: what you need is Forward Error Correction, that is implemented by any Error-Correcting Code…
the math behind it is completely different. it doesn't even use GF(2^n) fields at all :) as mentioned in RS.md, the encoding sheme is known since 2003 and even became a part of RFC
Well, it's MY code so i use term "block" in the same meaning as they use term "shard" :)
by block i mean the same thing as they mean by shard. it just doesn't make sense to count entire amount of data processed - only amount of data processed TOGETHER make a sense and yeah, it's quite hard to believe that…
Speed of RS coder depends on the amount of data/parity blocks. From the URL you mentioned, speed with 50+20 blocks is 713 MB/s. This algorithms is O(N^2) that means the speed is proportional to 1/N. So if it will…