Struct IprsCode 

pub struct IprsCode<Zt: ZipTypes, Config: PnttConfig, const REP: usize, const CHECK: bool> { /* private fields */ }

Pseudo Reed-Solomon encoder over the integers. Internally uses a radix-8 NTT-style recursion with a base Vandermonde matrix sized base_len x base_dim (defaults to 64x32).

Implementations

impl<Zt, Config, const REP: usize, const CHECK: bool> IprsCode<Zt, Config, REP, CHECK>

where Zt: ZipTypes, Config: PnttConfig,

pub fn new(row_len: usize, depth: usize) -> Result<Self, ZipError>

pub fn new_with_optimal_depth(row_len: usize) -> Result<Self, ZipError>

Create a new IPRS code with the optimal depth heuristics trying to keep number of columns in the base matrix small. Currently, keeps number of columns <= 2^8 but this might be tweaked in the future.

Trait Implementations

impl<Zt: Clone + ZipTypes, Config: Clone + PnttConfig, const REP: usize, const CHECK: bool> Clone for IprsCode<Zt, Config, REP, CHECK>

fn clone(&self) -> IprsCode<Zt, Config, REP, CHECK>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Zt, Config, const REP: usize, const CHECK: bool> Debug for IprsCode<Zt, Config, REP, CHECK>

where Zt: ZipTypes, Config: PnttConfig,

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

Formats the value using the given formatter.

impl<Zt, Config, const REP: usize, const CHECK: bool> LinearCode<Zt> for IprsCode<Zt, Config, REP, CHECK>

where Zt: ZipTypes, Config: PnttConfig, Zt::Eval: for<'a> MulByScalar<&'a PnttInt, Zt::Cw>, Zt::CombR: for<'a> MulByScalar<&'a PnttInt>, Zt::Cw: CheckedAdd + for<'a> MulByScalar<&'a PnttInt>,

const REPETITION_FACTOR: usize = REP

Repetition factor, a.k.a. inverse rate, the ratio of codeword length to input row length. Has to be at a power of 2.

fn encode(&self, row: &[Zt::Eval]) -> Vec<Zt::Cw>

Encodes a row of cryptographic integers using this linear encoding scheme.

fn row_len(&self) -> usize

Length of each input row before encoding

fn codeword_len(&self) -> usize

Length of each encoded codeword (output length after encoding)

fn params_string(&self) -> String

String representation of the parameters of this linear code, used for benchmarks. Should start with “row_len=X”.

fn encode_wide(&self, row: &[Zt::CombR]) -> Vec<Zt::CombR>

Encodes a row of cryptographic integers using this linear encoding scheme.

fn encode_f<F>(&self, row: &[F]) -> Vec<F>

where F: FromPrimitiveWithConfig + FromRef<F>,

Encodes a row of field elements using this linear encoding scheme.

impl<Zt, Config, const REP: usize, const CHECK: bool> PartialEq for IprsCode<Zt, Config, REP, CHECK>

where Config: PnttConfig, Zt: ZipTypes,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Zt, Config, const REP: usize, const CHECK: bool> Eq for IprsCode<Zt, Config, REP, CHECK>

where Zt: ZipTypes, Config: PnttConfig,