1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44

package utils

import (
	"sync"
)

type ReedSolomonEncoder struct {
	gf        *GaloisField
	polynomes []*GFPoly
	m         *sync.Mutex
}

func NewReedSolomonEncoder(gf *GaloisField) *ReedSolomonEncoder {
	return &ReedSolomonEncoder{
		gf, []*GFPoly{NewGFPoly(gf, []int{1})}, new(sync.Mutex),
	}
}

func (rs *ReedSolomonEncoder) getPolynomial(degree int) *GFPoly {
	rs.m.Lock()
	defer rs.m.Unlock()

	if degree >= len(rs.polynomes) {
		last := rs.polynomes[len(rs.polynomes)-1]
		for d := len(rs.polynomes); d <= degree; d++ {
			next := last.Multiply(NewGFPoly(rs.gf, []int{1, rs.gf.ALogTbl[d-1+rs.gf.Base]}))
			rs.polynomes = append(rs.polynomes, next)
			last = next
		}
	}
	return rs.polynomes[degree]
}

func (rs *ReedSolomonEncoder) Encode(data []int, eccCount int) []int {
	generator := rs.getPolynomial(eccCount)
	info := NewGFPoly(rs.gf, data)
	info = info.MultByMonominal(eccCount, 1)
	_, remainder := info.Divide(generator)

	result := make([]int, eccCount)
	numZero := int(eccCount) - len(remainder.Coefficients)
	copy(result[numZero:], remainder.Coefficients)
	return result
}