Struct ReedSolomon 

pub struct ReedSolomon<F> { /* private fields */ }

Systematic Reed–Solomon [n, k, n-k+1] encoder over the additive-FFT subspaces W_k ⊂ W_n: encode(msg)[..k] == msg (Lin–Chung–Han 2014).

Implementations

impl<F: BinaryFieldExtras + HardwareField> ReedSolomon<F>

pub fn new(log_k: u32, log_n: u32) -> Result<Self, RsError>

k = 2^log_k message and n = 2^log_n codeword symbols, 1 <= log_k < log_n <= min(F::BITS, usize::BITS - 1). The only allocation is the two twiddle schedules.

pub fn message_len(&self) -> usize

pub fn codeword_len(&self) -> usize

pub fn encode_scalar( &self, msg: &[Flat<F>], out: &mut [Flat<F>], ) -> Result<(), RsError>

Encode one row: msg.len() == k, out.len() == n, out[..k] == msg on return.

pub fn encode( &self, msg: &[PackedFlat<F>], out: &mut [PackedFlat<F>], ) -> Result<(), RsError>

Encode F::WIDTH rows in lockstep. Lengths are in packed elements: msg.len() == k, out.len() == n.