![]()  | 
  
  
  
    rssoft
    0.0.0
    
   Reed-Solomon codes library with soft decision decoding 
   | 
  
  
  
 
#include <iostream>#include <vector>#include <utility>#include <algorithm>#include <assert.h>#include "GFq.h"#include "GFq_Element.h"

Go to the source code of this file.
Classes | |
| class | rssoft::gf::GFq_Polynomial | 
| Univariate polynomials with coefficients in GF(2^m)  More... | |
Namespaces | |
| namespace | rssoft | 
| namespace | rssoft::gf | 
Functions | |
| void | rssoft::gf::simplify (GFq_Polynomial &polynomial) | 
| GFq_Polynomial | rssoft::gf::operator+ (const GFq_Polynomial &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator+ (const GFq_Polynomial &a, const GFq_Element &b) | 
| GFq_Polynomial | rssoft::gf::operator+ (const GFq_Element &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator+ (const GFq_Polynomial &a, const GFq_Symbol &b) | 
| GFq_Polynomial | rssoft::gf::operator+ (const GFq_Symbol &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator- (const GFq_Polynomial &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator- (const GFq_Polynomial &a, const GFq_Element &b) | 
| GFq_Polynomial | rssoft::gf::operator- (const GFq_Element &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator- (const GFq_Polynomial &a, const GFq_Symbol &b) | 
| GFq_Polynomial | rssoft::gf::operator- (const GFq_Symbol &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator* (const GFq_Polynomial &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator* (const GFq_Element &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator* (const GFq_Polynomial &a, const GFq_Element &b) | 
| GFq_Polynomial | rssoft::gf::operator/ (const GFq_Polynomial &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator/ (const GFq_Polynomial &a, const GFq_Element &b) | 
| GFq_Polynomial | rssoft::gf::operator% (const GFq_Polynomial &a, const GFq_Polynomial &b) | 
| GFq_Polynomial | rssoft::gf::operator% (const GFq_Polynomial &a, const unsigned int &power) | 
| GFq_Polynomial | rssoft::gf::operator^ (const GFq_Polynomial &a, const int &n) | 
| GFq_Polynomial | rssoft::gf::operator<< (const GFq_Polynomial &a, const unsigned int &n) | 
| GFq_Polynomial | rssoft::gf::operator>> (const GFq_Polynomial &a, const unsigned int &n) | 
| GFq_Polynomial | rssoft::gf::gcd (const GFq_Polynomial &a, const GFq_Polynomial &b) | 
| std::pair< GFq_Polynomial,  GFq_Polynomial >  | rssoft::gf::div (const GFq_Polynomial ÷nd, const GFq_Polynomial &divisor) | 
| std::vector< GFq_Element > | rssoft::gf::rootex_nz (const GFq_Polynomial &a) | 
| std::vector< GFq_Element > | rssoft::gf::rootex (const GFq_Polynomial &a) | 
| GFq_Polynomial | rssoft::gf::get_monic (const GFq_Polynomial &a, GFq_Element &lead_poly) | 
| std::vector< GFq_Polynomial > | rssoft::gf::square_free_decomposition (const GFq_Polynomial &ff) |