FastECC
Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT. (by Bulat-Ziganshin)
leopard
Leopard-RS : O(N Log N) MDS Reed-Solomon Block Erasure Code for Large Data (by catid)
Our great sponsors
| FastECC | leopard | |
|---|---|---|
| 3 | 2 | |
| 403 | 128 | |
| - | - | |
| 10.0 | 0.0 | |
| over 6 years ago | almost 2 years ago | |
| C++ | C++ | |
| Apache License 2.0 | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
FastECC
Posts with mentions or reviews of FastECC.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-07-10.
-
Hacker News top posts: Jul 10, 2022
FastECC – Reed-Solomon coder computing one million parity blocks at 1 GB/s\ (6 comments)
- FastECC – Reed-Solomon coder computing one million parity blocks at 1 GB/s
leopard
Posts with mentions or reviews of leopard.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-07-10.
-
reedsolomon package now supports up to 65536 shards
This mode is compatible with the RS-Leopard C-library, but is now ported to Go and assembly (SSSE3, AVX2 and AVX512). So no cgo required.
-
FastECC – Reed-Solomon coder computing one million parity blocks at 1 GB/s
That it uses a prime field is a bit awkward, as it requires repacking bytes to and from the field.
Leopard (https://github.com/catid/leopard) is similarly fast but constructed over GF(2^16) so it doesn't need any repacking. OTOH, that also limits it to 2^16 packets per codeword.
What are some alternatives?
When comparing FastECC and leopard you can also consider the following projects:
gokey - A simple vaultless password manager in Go
magus - Portable high-level assembler with authentic C syntax
mbtiles-s3-server - Python server to on-the-fly extract and serve vector tiles from an mbtiles file on S3
TiltedEvolution - Skyrim and Fallout 4 mod to play online!