rssoft  0.0.0
Reed-Solomon codes library with soft decision decoding
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
rssoft::EvaluationValuesEvaluation points of encoding polynomial and symbol values. Following the format of Reliability and Multiplicity matrices:
rssoft::FinalEvaluation
rssoft::gf::GF2_Element
rssoft::gf::GF2_Polynomial
rssoft::gf::GF_ExceptionGeneric exception class for Galois Field library
rssoft::gf::GFqGalois Field GF(q=2^m) class. Generates and holds lookup tables (LUT) for basic operations. Hosts basic operations and element representation conversions
rssoft::gf::GFq_BivariateMonomialBivariate Monomial class
rssoft::gf::GFq_BivariateMonomialExponentsBivariate monomial exponents
rssoft::gf::GFq_BivariatePolynomialBivariate polynomials with coefficients in GF(2^m) thus the polynomials in GF(2^m)[X,Y]. Division is intentionally omitted as this is complex and unnecessary for the application
rssoft::gf::GFq_Element
rssoft::gf::GFq_PolynomialUnivariate polynomials with coefficients in GF(2^m)
rssoft::gf::GFq_WeightedRevLex_BivariateMonomialWeighted reverse lexical order of bivariate monomials
rssoft::GSKV_Interpolation
rssoft::MultiplicityMatrixMultiplicity matrix corresponding to a reliability matrix. It is implemented as a map representing a sparse matrix where elements are indexed by their (row, column) numbers pair. Once constructed it is normally only used to be traversed column first during the Interpolation algorithm. The ordering of indexes reflects the column first order
rssoft::MultiplicityMatrix_SparseOrderingOrdering of elements in the sparse matrix according to the column first order. Indexes are pairs of (row, column) indexes
rssoft::ProbabilityCodewordProbability score weighted codeword
rssoft::ReliabilityMatrixReliability Matrix class. Analog data is entered first then the normalization method is called to get the actual reliability data (probabilities)
rssoft::RR_FactorizationRoth-Ruckenstein's factorization
rssoft::RR_NodeNode in the Roth-Ruckenstein's algorithm
rssoft::RS_EncodingDoes the Reed-Solomon encoding of a message. his is the genuine, straightforward, non-systematic encoding that takes message symbols to build the successive coefficients of the encoding polynomial. Then this polynomial is evaluated at the evaluation points to make the codeword
rssoft::RSSoft_ExceptionGeneric exception class for Reed-Solomon Soft decision decoding library
rssoft::MultiplicityMatrix::traversing_iterator
 All Classes Namespaces Files Functions Variables Typedefs Friends Defines