class d_Rand_equal_constraints |
Random decomposition algorithm with equal constraints.
![]() | d_Rand_equal_constraints () Dummy constructor |
![]() | d_Rand_equal_constraints (unsigned nclass, unsigned ndico, unsigned min_dicho_dist = 1, unsigned min_codeword_dist = 2, unsigned ntimes = 10) Constructor |
![]() | d_Rand_equal_constraints (char* file) Constructor |
![]() | d_Rand_equal_constraints (const d_Rand_equal_constraints& d) Copy constructor |
![]() | operator= (const d_Rand_equal_constraints& d) Overload assignement operator |
Decomposition random algorithm with 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 equal to a desired threshold, or, if the maximun number of iterations is reached, the minimum of the maximum. 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