reedsolomon-go

History

Elias Naur 49be604db0 Add an efficient implementation of shard counts up to 65536 (#191 ) This is a O(n*log n) implementation of Reed-Solomon codes, ported from the C++ library https://github.com/catid/leopard. The implementation is based on the paper "Novel Polynomial Basis with Fast Fourier Transform and Its Application to Reed-Solomon Erasure Codes" Several TODOs are left for future commits: - Performance optimizations, in particular SIMD and multiple goroutines - Documentation - Detailed Tests - Merging of reedSolomonFF16 and reedSolomon types - Turn the straight C++ port into more idiomatic Go This change also bumps one race testing timeout, to ensure adequate time on CI.	2022-07-21 14:27:10 +02:00
..
codeql-analysis.yml	Add codeql (#192 )	2022-07-13 16:25:26 +02:00
go.yml	Add an efficient implementation of shard counts up to 65536 (#191 )	2022-07-21 14:27:10 +02:00

Add an efficient implementation of shard counts up to 65536 (#191 )

This is a O(n*log n) implementation of Reed-Solomon
codes, ported from the C++ library https://github.com/catid/leopard.

The implementation is based on the paper

"Novel Polynomial Basis with Fast Fourier Transform
and Its Application to Reed-Solomon Erasure Codes"

Several TODOs are left for future commits:

- Performance optimizations, in particular SIMD and multiple goroutines
- Documentation
- Detailed Tests
- Merging of reedSolomonFF16 and reedSolomon types
- Turn the straight C++ port into more idiomatic Go

This change also bumps one race testing timeout, to ensure adequate
time on CI.

2022-07-21 14:27:10 +02:00

codeql-analysis.yml

Add codeql (#192 )

2022-07-13 16:25:26 +02:00

go.yml

Add an efficient implementation of shard counts up to 65536 (#191 )

2022-07-21 14:27:10 +02:00