class d_Rand_gr_equal_constraints |
Random decompsition algorithm with greater or equal constraints.
![]() | d_Rand_gr_equal_constraints () Dummy constructor |
![]() | d_Rand_gr_equal_constraints (unsigned nclass, unsigned ndico, unsigned min_dicho_dist = 1, unsigned min_codeword_dist = 2, unsigned ntimes = 10) Constructor |
![]() | d_Rand_gr_equal_constraints (char* file) Constructor |
![]() | ~d_Rand_gr_equal_constraints () Destructor |
![]() | decrementHD (int n_pos = 1, int ntimes = 1, bool pos = false) Algorithm to decrement the minimum Hammin distance between codewords It tries to decremet the minimum Hamming distance between codewords substituting randomly a row with a fixed numer of +1 or -1 to the decomposition matrix. |
![]() | incrementHD (int n_pos = 1, int ntimes = 1, bool pos = false) Algorithm to increment the minimum Hammin distance between codewords It tries to increment the minimum Hamming distance between codewords substituting randomly a row with a fixed numer of +1 or -1 to the decomposition matrix. |
![]() | d_Rand_gr_equal_constraints (const d_Rand_gr_equal_constraints& d) Copy constructor |
![]() | operator= (const d_Rand_gr_equal_constraints& d) Overload assignement operator |
![]() | times Iterations of the random generation |
![]() | seed initial seed for the random generator |
![]() | Do_Rand_matrix (unsigned min_dicho_dist = 1, unsigned min_codeword_dist = 2, unsigned ntimes = 1) Build a decomposition matrix D using random codes and returns the minimum Hamming distance between columns. |
![]() | Make_Rand_matrix (unsigned min_dicho_dist = 1) Build a single decomposition matrix D using random codes. |
![]() | generate_row (vect& x, bool pos = false, int n_pos = 1) Generates a random row of the matrix with a fixed number of +1 and -1 |
Decomposition random algorithm with greater or equal constraints
It generates random constrained codes using random generation and selecting the codes with the maximum of the minimum pairwise Hamming distance between the codewords above a desired threshold, or, if the maximun number of iterations is reached, the best codes generated. Only correct and not trivial decomposition matrices are generated (that is only decompostion matrices with no equal rows or columns without complementary rows). Generation algorithms allow constraints also on the minimum Hamming distance between rows (diversity of dichotomizers' task).
Alphabetic index HTML hierarchy of classes or Java