![]() |
rssoft
0.0.0
Reed-Solomon codes library with soft decision decoding
|
Bivariate monomial exponents. More...
#include <GFq_BivariateMonomial.h>
Public Member Functions | |
| GFq_BivariateMonomialExponents (unsigned int eX, unsigned int eY) | |
| GFq_BivariateMonomialExponents (const std::pair< unsigned int, unsigned int > &_exponents) | |
| unsigned int | x () const |
| unsigned int | y () const |
| unsigned int | wdeg (unsigned int wX, unsigned int wY) const |
| unsigned int | wdeg (const std::pair< unsigned int, unsigned int > &weights) const |
| bool | are_zero () const |
Bivariate monomial exponents.
| rssoft::gf::GFq_BivariateMonomialExponents::GFq_BivariateMonomialExponents | ( | unsigned int | eX, |
| unsigned int | eY | ||
| ) |
:
std::pair<unsigned int, unsigned int>(eX, eY)
{}
| rssoft::gf::GFq_BivariateMonomialExponents::GFq_BivariateMonomialExponents | ( | const std::pair< unsigned int, unsigned int > & | _exponents | ) |
:
std::pair<unsigned int, unsigned int>(_exponents)
{}
| bool rssoft::gf::GFq_BivariateMonomialExponents::are_zero | ( | ) | const [inline] |
Tests if both exponents are 0 (monomial represents the constant coefficient)
{
return (first == 0) && (second == 0);
}
| unsigned int rssoft::gf::GFq_BivariateMonomialExponents::wdeg | ( | unsigned int | wX, |
| unsigned int | wY | ||
| ) | const [inline] |
Returns the weighted degree
| wX | Weight in X |
| wY | Weight in Y |
{
return wX*first + wY*second;
}
| unsigned int rssoft::gf::GFq_BivariateMonomialExponents::wdeg | ( | const std::pair< unsigned int, unsigned int > & | weights | ) | const [inline] |
Returns the weighted degree
| weihgts | Pair of weights in (X,Y) |
{
return weights.first*first + weights.second*second;
}
| unsigned int rssoft::gf::GFq_BivariateMonomialExponents::x | ( | ) | const [inline] |
Returns the exponent in x
{
return first;
}
| unsigned int rssoft::gf::GFq_BivariateMonomialExponents::y | ( | ) | const [inline] |
Returns the exponent in y
{
return second;
}