Struct Polynomial 

pub struct Polynomial {
    pub num: Vec<i32>,
}

Polynomial with coefficients in GF(256) Coefficients are stored in descending order (num[0] = highest degree)

Fields

num: Vec<i32>

Implementations

impl Polynomial

pub fn new(num: Vec<i32>, _shift: i32) -> Polynomial

Create a polynomial from coefficients

pub fn get(&self, index: usize) -> i32

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn multiply(&self, e: &Polynomial) -> Polynomial

Multiply two polynomials in GF(256)

pub fn generate_rs_poly(ec_count: i32) -> Polynomial

Generate Reed-Solomon error correction polynomial g(x) = (x + α^0)(x + α^1)…(x + α^(ec_count-1))

pub fn mod(&self, e: &Polynomial) -> Polynomial

Polynomial modulo operation (descending order)

pub fn mod_with_shift(&self, e: &Polynomial, shift: i32) -> Polynomial

Modulo with shift (for RS error correction calculation)