Compute Reed-Solomon Error Correction Codewords from a QR-Code Encoding

Question

for a little project I'm asked to come up with a little QR-Code encoder in Go. After successfully completing the analysing and encoding part, I'm now trying to wrap my head around the error correction using the following package:

https://github.com/klauspost/reedsolomon

Essentially, I don't understand how to structure the data and parity shards inputs in connection with a specific QR-Code version and its specifications.

Thanks in advance.

Answer 1

See research.swtch.com/field and research.swtch.com/qart.