![]() |
rssoft
0.0.0
Reed-Solomon codes library with soft decision decoding
|
add(const GFq_Symbol &a, const GFq_Symbol &b) const | rssoft::gf::GFq | [inline] |
alpha(const unsigned int power) const | rssoft::gf::GFq | [inline] |
alpha_to | rssoft::gf::GFq | [private] |
div(const GFq_Symbol &a, const GFq_Symbol &b) const | rssoft::gf::GFq | [inline] |
div_table | rssoft::gf::GFq | [private] |
exp(const GFq_Symbol &a, const int &n) const | rssoft::gf::GFq | [inline] |
exp_table | rssoft::gf::GFq | [private] |
fast_modulus(GFq_Symbol x) const | rssoft::gf::GFq | [private] |
field_size | rssoft::gf::GFq | [private] |
gen_div(const GFq_Symbol &a, const GFq_Symbol &b) const | rssoft::gf::GFq | [private] |
gen_exp(const GFq_Symbol &a, const unsigned int &n) const | rssoft::gf::GFq | [private] |
gen_inverse(const GFq_Symbol &val) const | rssoft::gf::GFq | [private] |
gen_mul(const GFq_Symbol &a, const GFq_Symbol &b) const | rssoft::gf::GFq | [private] |
generate_field() | rssoft::gf::GFq | [private] |
GFq(const int pwr, const GF2_Polynomial &primitive_poly) | rssoft::gf::GFq | |
GFq(const GFq &gf) | rssoft::gf::GFq | |
index(const GFq_Symbol value) const | rssoft::gf::GFq | [inline] |
index_of | rssoft::gf::GFq | [private] |
inverse(const GFq_Symbol &val) const | rssoft::gf::GFq | [inline] |
mul(const GFq_Symbol &a, const GFq_Symbol &b) const | rssoft::gf::GFq | [inline] |
mul_inverse | rssoft::gf::GFq | [private] |
mul_table | rssoft::gf::GFq | [private] |
operator!=(const GFq &gf) const | rssoft::gf::GFq | |
operator<<(std::ostream &os, const GFq &gf) | rssoft::gf::GFq | [friend] |
operator=(const GFq &gf) | rssoft::gf::GFq | |
operator==(const GFq &gf) const | rssoft::gf::GFq | |
power | rssoft::gf::GFq | [private] |
prim_poly_hash | rssoft::gf::GFq | [private] |
primitive_poly | rssoft::gf::GFq | [private] |
pwr() const | rssoft::gf::GFq | [inline] |
size() const | rssoft::gf::GFq | [inline] |
sub(const GFq_Symbol &a, const GFq_Symbol &b) const | rssoft::gf::GFq | [inline] |
~GFq() | rssoft::gf::GFq |