pub struct ReedSolomonCode<F> { /* private fields */ }Expand description
Reed–Solomon codes over binary fields.
The Reed–Solomon code admits an efficient encoding algorithm over binary fields due to LCH14. The additive NTT encoding algorithm encodes messages interpreted as the coefficients of a polynomial in a non-standard, novel polynomial basis and the codewords are the polynomial evaluations over a linear subspace of the field. See the [binius-math] crate for more details.
Implementations§
Source§impl<F> ReedSolomonCode<F>
impl<F> ReedSolomonCode<F>
pub fn subspace(&self) -> &BinarySubspace<F>
Source§impl<F> ReedSolomonCode<F>
impl<F> ReedSolomonCode<F>
pub fn log_inv_rate(&self) -> usize
Source§impl<F: BinaryField> ReedSolomonCode<F>
impl<F: BinaryField> ReedSolomonCode<F>
pub fn new(log_dimension: usize, log_inv_rate: usize) -> Result<Self, Error>
pub fn with_ntt_subspace( ntt: &impl AdditiveNTT<Field = F>, log_dimension: usize, log_inv_rate: usize, ) -> Result<Self, Error>
pub fn with_domain_context_subspace( domain_context: &impl DomainContext<Field = F>, log_dimension: usize, log_inv_rate: usize, ) -> Result<Self, Error>
pub fn with_subspace( subspace: BinarySubspace<F>, log_dimension: usize, log_inv_rate: usize, ) -> Result<Self, Error>
pub const fn log_dim(&self) -> usize
pub const fn log_len(&self) -> usize
Sourcepub fn encode_batch_inplace<P: PackedField<Scalar = F>, NTT: AdditiveNTT<Field = F> + Sync>(
&self,
ntt: &NTT,
code: &mut [P],
log_batch_size: usize,
) -> Result<(), Error>
pub fn encode_batch_inplace<P: PackedField<Scalar = F>, NTT: AdditiveNTT<Field = F> + Sync>( &self, ntt: &NTT, code: &mut [P], log_batch_size: usize, ) -> Result<(), Error>
Encode a batch of interleaved messages in-place in a provided buffer.
The message symbols are interleaved in the buffer, which improves the cache-efficiency of the encoding procedure. The interleaved codeword is stored in the buffer when the method completes.
§Throws
- If the
codebuffer does not have capacity forlen() << log_batch_sizefield elements.
Sourcepub fn encode_batch<P: PackedField<Scalar = F>, NTT: AdditiveNTT<Field = F> + Sync>(
&self,
ntt: &NTT,
data: &[P],
output: &mut [MaybeUninit<P>],
log_batch_size: usize,
) -> Result<(), Error>
pub fn encode_batch<P: PackedField<Scalar = F>, NTT: AdditiveNTT<Field = F> + Sync>( &self, ntt: &NTT, data: &[P], output: &mut [MaybeUninit<P>], log_batch_size: usize, ) -> Result<(), Error>
Encode a batch of interleaved messages into a provided output buffer.
This function encodes multiple messages in parallel by copying the input data to all chunks of the output buffer and then applying the NTT transformation. The messages are interleaved in both the input and output buffers, which improves cache efficiency.
§Preconditions
- The input
datamust contain exactlydim() << log_batch_sizefield elements. - The output buffer must have capacity for
len() << log_batch_sizefield elements.
§Postconditions
- On success, all elements in the output buffer are initialized with the encoded codeword.
§Throws
Error::EncoderSubspaceMismatchif the NTT subspace doesn’t match the code’s subspace.Error::Mathif the output buffer has incorrect dimensions.
Sourcepub fn encode_ext_batch_inplace<PE: PackedExtension<F>, NTT: AdditiveNTT<Field = F> + Sync>(
&self,
ntt: &NTT,
code: &mut [PE],
log_batch_size: usize,
) -> Result<(), Error>
pub fn encode_ext_batch_inplace<PE: PackedExtension<F>, NTT: AdditiveNTT<Field = F> + Sync>( &self, ntt: &NTT, code: &mut [PE], log_batch_size: usize, ) -> Result<(), Error>
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::DEGREEmust be a power of two.
§Throws
- If the
codebuffer does not have capacity forlen() << log_batch_sizefield elements.
Sourcepub fn encode_ext_batch<PE: PackedExtension<F>, NTT: AdditiveNTT<Field = F> + Sync>(
&self,
ntt: &NTT,
data: &[PE],
output: &mut [MaybeUninit<PE>],
log_batch_size: usize,
) -> Result<(), Error>
pub fn encode_ext_batch<PE: PackedExtension<F>, NTT: AdditiveNTT<Field = F> + Sync>( &self, ntt: &NTT, data: &[PE], output: &mut [MaybeUninit<PE>], log_batch_size: usize, ) -> Result<(), Error>
Encode a batch of interleaved messages of extension field elements into 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::DEGREEmust be a power of two.- The input
datamust contain exactlydim() << log_batch_sizefield elements. - The output buffer must have capacity for
len() << log_batch_sizefield elements.
§Postconditions
- On success, all elements in the output buffer are initialized with the encoded codeword.
§Throws
Error::EncoderSubspaceMismatchif the NTT subspace doesn’t match the code’s subspace.Error::Mathif the output buffer has incorrect dimensions.
Trait Implementations§
Source§impl<F: Clone> Clone for ReedSolomonCode<F>
impl<F: Clone> Clone for ReedSolomonCode<F>
Source§fn clone(&self) -> ReedSolomonCode<F>
fn clone(&self) -> ReedSolomonCode<F>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl<F> Freeze for ReedSolomonCode<F>
impl<F> RefUnwindSafe for ReedSolomonCode<F>where
F: RefUnwindSafe,
impl<F> Send for ReedSolomonCode<F>where
F: Send,
impl<F> Sync for ReedSolomonCode<F>where
F: Sync,
impl<F> Unpin for ReedSolomonCode<F>where
F: Unpin,
impl<F> UnwindSafe for ReedSolomonCode<F>where
F: UnwindSafe,
Blanket Implementations§
§impl<T> AsMaybeUninit for T
impl<T> AsMaybeUninit for T
§type Uninit = MaybeUninit<T>
type Uninit = MaybeUninit<T>
§fn as_ref_uninit(&self) -> &<T as AsMaybeUninit>::Uninit
fn as_ref_uninit(&self) -> &<T as AsMaybeUninit>::Uninit
&self to its maybe-initialized equivalent.§unsafe fn as_mut_uninit(&mut self) -> &mut <T as AsMaybeUninit>::Uninit
unsafe fn as_mut_uninit(&mut self) -> &mut <T as AsMaybeUninit>::Uninit
&mut T to its maybe-initialized equivalent. Read more§unsafe fn raw_as_uninit<'a>(raw: *const T) -> &'a <T as AsMaybeUninit>::Uninit
unsafe fn raw_as_uninit<'a>(raw: *const T) -> &'a <T as AsMaybeUninit>::Uninit
§unsafe fn raw_mut_as_uninit<'a>(
raw: *mut T,
) -> &'a mut <T as AsMaybeUninit>::Uninit
unsafe fn raw_mut_as_uninit<'a>( raw: *mut T, ) -> &'a mut <T as AsMaybeUninit>::Uninit
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more