Struct ReedSolomonCode

Source
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>

Source

pub fn subspace(&self) -> &BinarySubspace<F>

Source§

impl<F> ReedSolomonCode<F>

Source

pub fn log_inv_rate(&self) -> usize

Source§

impl<F: BinaryField> ReedSolomonCode<F>

Source

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

Source

pub fn with_ntt_subspace( ntt: &impl AdditiveNTT<Field = F>, log_dimension: usize, log_inv_rate: usize, ) -> Result<Self, Error>

Source

pub fn with_domain_context_subspace( domain_context: &impl DomainContext<Field = F>, log_dimension: usize, log_inv_rate: usize, ) -> Result<Self, Error>

Source

pub fn with_subspace( subspace: BinarySubspace<F>, log_dimension: usize, log_inv_rate: usize, ) -> Result<Self, Error>

Source

pub const fn dim(&self) -> usize

The dimension.

Source

pub const fn log_dim(&self) -> usize

Source

pub const fn log_len(&self) -> usize

Source

pub const fn len(&self) -> usize

The block length.

Source

pub const fn inv_rate(&self) -> usize

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

Source

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 code buffer does not have capacity for len() << log_batch_size field elements.
Source

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 data must contain exactly dim() << log_batch_size field elements.
  • The output buffer must have capacity for len() << log_batch_size field elements.
§Postconditions
  • On success, all elements in the output buffer are initialized with the encoded codeword.
§Throws
Source

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::DEGREE must be a power of two.
§Throws
  • If the code buffer does not have capacity for len() << log_batch_size field elements.
Source

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::DEGREE must be a power of two.
  • The input data must contain exactly dim() << log_batch_size field elements.
  • The output buffer must have capacity for len() << log_batch_size field elements.
§Postconditions
  • On success, all elements in the output buffer are initialized with the encoded codeword.
§Throws

Trait Implementations§

Source§

impl<F: Clone> Clone for ReedSolomonCode<F>

Source§

fn clone(&self) -> ReedSolomonCode<F>

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<F: Debug> Debug for ReedSolomonCode<F>

Source§

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

Formats the value using the given formatter. Read more

Auto 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§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T> AsMaybeUninit for T

§

type Uninit = MaybeUninit<T>

This type in its maybe-uninitialized form.
§

type SizedPart = T

The largest Sized element in Self, used to check for the absence of drop glue via a Copy bound. Read more
§

fn as_ref_uninit(&self) -> &<T as AsMaybeUninit>::Uninit

Converts a &self to its maybe-initialized equivalent.
§

unsafe fn as_mut_uninit(&mut self) -> &mut <T as AsMaybeUninit>::Uninit

Converts a &mut T to its maybe-initialized equivalent. Read more
§

unsafe fn raw_as_uninit<'a>(raw: *const T) -> &'a <T as AsMaybeUninit>::Uninit

Converts a raw pointer to a reference to maybe-uninit. Read more
§

unsafe fn raw_mut_as_uninit<'a>( raw: *mut T, ) -> &'a mut <T as AsMaybeUninit>::Uninit

Converts a raw mutable pointer to a mutable reference to maybe-uninit. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts 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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts 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
§

impl<T> ManuallyDropMut for T

§

type Ret = ManuallyDrop<T>

§

fn manually_drop_mut<'__>(&'__ mut self) -> &'__ mut ManuallyDrop<T>

§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more