pub struct RaaSignFlippingCode<Zt: ZipTypes, Config: RaaConfig, const REP: usize> { /* private fields */ }Expand description
Implementation of a repeat-accumulate-accumulate (RAA) codes. Flips signs of every second entry in the codeword, starting from the second one.
Implementations§
Trait Implementations§
Source§impl<Zt: Clone + ZipTypes, Config: Clone + RaaConfig, const REP: usize> Clone for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt: Clone + ZipTypes, Config: Clone + RaaConfig, const REP: usize> Clone for RaaSignFlippingCode<Zt, Config, REP>
Source§fn clone(&self) -> RaaSignFlippingCode<Zt, Config, REP>
fn clone(&self) -> RaaSignFlippingCode<Zt, Config, REP>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<Zt: ZipTypes, Config: RaaConfig, const REP: usize> Debug for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt: ZipTypes, Config: RaaConfig, const REP: usize> Debug for RaaSignFlippingCode<Zt, Config, REP>
Source§impl<Zt: ZipTypes, Config: RaaConfig, const REP: usize> LinearCode<Zt> for RaaSignFlippingCode<Zt, Config, REP>where
Zt::Cw: Ring,
impl<Zt: ZipTypes, Config: RaaConfig, const REP: usize> LinearCode<Zt> for RaaSignFlippingCode<Zt, Config, REP>where
Zt::Cw: Ring,
Source§const REPETITION_FACTOR: usize = REP
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. Read more
Source§fn codeword_len(&self) -> usize
fn codeword_len(&self) -> usize
Length of each encoded codeword (output length after encoding)
Source§fn params_string(&self) -> String
fn params_string(&self) -> String
String representation of the parameters of this linear code, used for
benchmarks. Should start with “row_len=X”.
Source§fn encode(&self, row: &[Zt::Eval]) -> Vec<Zt::Cw>
fn encode(&self, row: &[Zt::Eval]) -> Vec<Zt::Cw>
Encodes a row of cryptographic integers using this linear encoding
scheme. Read more
Source§impl<Zt: ZipTypes, Config: RaaConfig, const REP: usize> PartialEq for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt: ZipTypes, Config: RaaConfig, const REP: usize> PartialEq for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt: ZipTypes, Config: RaaConfig, const REP: usize> Eq for RaaSignFlippingCode<Zt, Config, REP>
Auto Trait Implementations§
impl<Zt, Config, const REP: usize> Freeze for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt, Config, const REP: usize> RefUnwindSafe for RaaSignFlippingCode<Zt, Config, REP>where
Zt: RefUnwindSafe,
Config: RefUnwindSafe,
impl<Zt, Config, const REP: usize> Send for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt, Config, const REP: usize> Sync for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt, Config, const REP: usize> Unpin for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt, Config, const REP: usize> UnsafeUnpin for RaaSignFlippingCode<Zt, Config, REP>
impl<Zt, Config, const REP: usize> UnwindSafe for RaaSignFlippingCode<Zt, Config, REP>where
Zt: UnwindSafe,
Config: UnwindSafe,
Blanket Implementations§
§impl<T> AsMaybeUninit for T
impl<T> AsMaybeUninit for T
§type Uninit = MaybeUninit<T>
type Uninit = MaybeUninit<T>
This type in its maybe-uninitialized form.
§fn as_ref_uninit(&self) -> &<T as AsMaybeUninit>::Uninit
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
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
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
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> 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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
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>
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 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>
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