![]() |
rssoft
0.0.0
Reed-Solomon codes library with soft decision decoding
|
Weighted reverse lexical order of bivariate monomials. More...
#include <GFq_BivariateMonomial.h>
Public Member Functions | |
GFq_WeightedRevLex_BivariateMonomial (unsigned int w_x, unsigned int w_y) | |
GFq_WeightedRevLex_BivariateMonomial (const std::pair< unsigned int, unsigned int > &weights) | |
bool | operator() (const GFq_BivariateMonomialExponents &e1, const GFq_BivariateMonomialExponents &e2) const |
~GFq_WeightedRevLex_BivariateMonomial () | |
Protected Attributes | |
std::pair< unsigned int, unsigned int > | weights |
Weighted reverse lexical order of bivariate monomials.
rssoft::gf::GFq_WeightedRevLex_BivariateMonomial::GFq_WeightedRevLex_BivariateMonomial | ( | unsigned int | w_x, |
unsigned int | w_y | ||
) |
Constructs a new weighted reverse lexical order of bivariate monomials
w_x | Weight in X |
w_y | Weight in Y |
: weights(w_x, w_y) {}
rssoft::gf::GFq_WeightedRevLex_BivariateMonomial::GFq_WeightedRevLex_BivariateMonomial | ( | const std::pair< unsigned int, unsigned int > & | weights | ) |
Constructs a new weighted reverse lexical order of bivariate monomials
weights | Weights in (X,Y) |
: weights(_weights) {}
Destructor
{}
bool rssoft::gf::GFq_WeightedRevLex_BivariateMonomial::operator() | ( | const GFq_BivariateMonomialExponents & | e1, |
const GFq_BivariateMonomialExponents & | e2 | ||
) | const |
Ordering method
e1 | First monomial exponents, if lesser than second then return is true |
e2 | Second monomial exponents, if greater than first then return is true |
{ unsigned int w1 = e1.wdeg(weights.first, weights.second); unsigned int w2 = e2.wdeg(weights.first, weights.second); if (w1 == w2) { return e1.x() > e2.x(); } else { return (w1 < w2); } }
std::pair<unsigned int, unsigned int> rssoft::gf::GFq_WeightedRevLex_BivariateMonomial::weights [protected] |