SianJhengLin / Fast-algorithms-of-Reed-Solomon-erasure-codes
☆22Updated 10 months ago
Alternatives and similar repositories for Fast-algorithms-of-Reed-Solomon-erasure-codes
Users that are interested in Fast-algorithms-of-Reed-Solomon-erasure-codes are comparing it to the libraries listed below
Sorting:
- Experimental parallel compression algorithm☆24Updated 7 years ago
- Automatically exported from code.google.com/p/mmc☆29Updated 2 years ago
- Siamese : Infinite-Window Streaming Erasure Code (HARQ)☆49Updated 4 years ago
- FEC-AL : O(N^2) Fountain Code for Small Data☆38Updated 4 years ago
- Benchmark results for lossless data compressors☆9Updated 6 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Leopard-RS : O(N Log N) MDS Reed-Solomon Block Erasure Code for Large Data☆149Updated last year
- Fast and Strong Burrows Wheeler Model☆19Updated 6 years ago
- Fast Erasure Coding Library for Large Number of Data and Parities☆29Updated 5 years ago
- Cauchy Caterpillar : O(N^2) Short-Window Streaming Erasure Code☆36Updated 4 years ago
- Common code library☆14Updated 7 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- Benchmarking reading and parsing integers from a file in C++.☆9Updated 5 years ago
- This repository contains my experiments with compression-related algorithms☆35Updated 8 years ago
- This package contains source code for special JPEG decompression and recompression routines, which may help developers as a framework in…☆16Updated 9 years ago
- Small library providing a platform layer☆13Updated last week
- RLU resizable hash-table☆17Updated 9 years ago
- a copy of m^2 's fsbench (https://chiselapp.com/user/Justin_be_my_guide/repository/fsbench/) with the latest density updates☆13Updated 5 years ago
- Fast and Reliable (but not Secure) Hash☆53Updated 6 years ago
- A compressed bitset with supporting data structures and algorithms☆19Updated 11 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- Experiment: Fast finite field Fp=2^61-1 in C++☆11Updated 6 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Fast in-memory B+-Tree implementation in C.☆29Updated 9 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Fast implementation of Content Defined Chunking (CDC) based on a rolling Rabin Checksum in C.☆56Updated 10 years ago
- A splaytree ADT written in C with a BSD license☆18Updated 4 years ago
- this repository is a read only mirror, the upstream is☆70Updated 2 years ago
- rans optimized tricks☆24Updated 7 years ago