|
| | MasseyDomain (size_t ett_default=LINBOX_DEFAULT_EARLY_TERMINATION_THRESHOLD) |
| |
| | MasseyDomain (const MasseyDomain< Field, Sequence > &Mat, size_t ett_default=LINBOX_DEFAULT_EARLY_TERMINATION_THRESHOLD) |
| |
| | MasseyDomain (Sequence *D, size_t ett_default=LINBOX_DEFAULT_EARLY_TERMINATION_THRESHOLD) |
| |
| | MasseyDomain (Sequence *MD, const Field &F, size_t ett_default=LINBOX_DEFAULT_EARLY_TERMINATION_THRESHOLD) |
| |
| template<class Polynomial> |
| long | operator() (Polynomial &C, bool full_poly=false) |
| |
| const Field & | field () const |
| |
| const Field & | getField () const |
| |
| Sequence * | getSequence () const |
| |
| void | pseudo_rank (size_t &rank) |
| |
| void | valence (Element &Valence, size_t &rank) |
| |
| template<class Polynomial> |
| size_t | pseudo_minpoly (Polynomial &phi, size_t &rank, bool full_poly=true) |
| |
| template<class Polynomial> |
| void | minpoly (Polynomial &phi, size_t &rank, bool full_poly=true) |
| |
template<class
Field, class Sequence>
class LinBox::MasseyDomain< Field, Sequence >
Berlekamp/Massey algorithm.
Domain Massey
- Computation is stopped when the polynomials remain the same for more than EARLY_TERM_THRESOLD
- When minimal polynomial equals characteristic polynomial, 2 additional iterations are needed to compute it (parameter DEFAULT_ADDITIONAL_ITERATION), but those iterations are not needed for the rank