Enum FillPolicy 

pub enum FillPolicy {
    Random,
    Uniform,
}

Policy used to select the rows to fill when adding a new column in the MacKay-Neal algorith.

The Random policy chooses rows completely randomly, and only imposes the maximum row weigth constraint of the configuration. This has the drawback that near the end of the algorithm too many rows can be full, while other rows have too many missing items. Therefore, the algorithm will fail. Even if backtracking is used, it is unlikely that the algorithm suceeds when the matrix is large and the LDPC code is regular, so that all the rows will necessarily end up with the same row weight.

The Uniform policy solves this problem by always picking rows which have the lower weight possible. There is still some randomness involved in the selection of rows, but the only choices that are considered are those with the property that it is not possible to exchange one of the choosen rows by another row that was not chosen and has stricly less weight.

Variants

Random

Choose randomly from the set of rows whose weight is less than the maximum row weight.

Uniform

Try to choose only among the rows which have lower weight.

Trait Implementations

impl Clone for FillPolicy

fn clone(&self) -> FillPolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FillPolicy

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

Formats the value using the given formatter.

impl PartialEq for FillPolicy

fn eq(&self, other: &FillPolicy) -> 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 Copy for FillPolicy

impl Eq for FillPolicy

impl StructuralPartialEq for FillPolicy