Bytes.reedSolomon255223Protect

Bytes.reedSolomon255223Protect accepts between 1 and 14614305 input bytes. Empty input and larger input return Err with a string.

Input bytes are partitioned into consecutive 223-byte data chunks. The final chunk is padded with zero bytes to 223 bytes.

Each output codeword contains its 223 data bytes followed by 32 parity bytes. Codewords are concatenated in input order.

The result contains 255 times the ceiling of input length divided by 223 bytes. At most 65535 codewords are produced.

Field arithmetic uses GF256 with primitive polynomial 0x11d and primitive element 2. Generator roots are the powers of that element from 0 through 31.

Treat the first data byte as the highest-degree coefficient. Parity is the 32-byte remainder after multiplying the data polynomial by x to the power 32.

The output contains no original length or additional framing. Callers must retain the input length to distinguish padding from original trailing zero bytes.

The operation generates parity bytes. It does not detect or correct corruption in existing codewords.

The receiver evaluates once and remains unchanged. Input bounds are checked before output allocation and failure exposes no codeword prefix.