Struct ReedSolomonCode

pub struct ReedSolomonCode<P>
where
    P: PackedField,
    P::Scalar: BinaryField,
{ /* private fields */ }

Implementations

impl<P> ReedSolomonCode<P>

where P: PackedField, P::Scalar: BinaryField,

pub fn log_inv_rate(&self) -> usize

impl<P> ReedSolomonCode<P>

where P: PackedField<Scalar: BinaryField>,

pub fn new( log_dimension: usize, log_inv_rate: usize, ntt_options: &NTTOptions, ) -> Result<Self, Error>

pub const fn get_ntt(&self) -> &impl AdditiveNTT<P>

pub const fn dim(&self) -> usize

The dimension.

pub const fn log_dim(&self) -> usize

pub const fn log_len(&self) -> usize

pub const fn len(&self) -> usize

The block length.

pub const fn inv_rate(&self) -> usize

The reciprocal of the rate, ie. self.len() / self.dim().

pub fn encode_ext_batch_inplace<PE>( &self, code: &mut [PE], log_batch_size: usize, ) -> Result<(), Error>

where PE: RepackedExtension<P>, PE::Scalar: ExtensionField<<P as PackedField>::Scalar>,

Encode a batch of interleaved messages of extension field elements in-place in a provided buffer.

A linear code can be naturally extended to a code over extension fields by encoding each dimension of the extension as a vector-space separately.

Preconditions

• PE::Scalar::DEGREE must be a power of two.

Throws

• If the code buffer does not have capacity for len() << log_batch_size field elements.

Trait Implementations

impl<P> Debug for ReedSolomonCode<P>

where P: PackedField + Debug, P::Scalar: BinaryField + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.