class d_Rand_constraints_multiple |
Random decomposition algorithm with equal constraints.
![]() | d_Rand_constraints_multiple () Dummy constructor |
![]() | d_Rand_constraints_multiple (unsigned nclass, unsigned ndico, char* file, unsigned min_dicho_dist = 1, unsigned min_codeword_dist = 2, unsigned max_codeword_dist = 4, unsigned ntimes = 10) Constructor |
![]() | d_Rand_constraints_multiple (char* file) Constructor |
![]() | d_Rand_constraints_multiple (const d_Rand_constraints_multiple& d) Copy constructor |
![]() | operator= (const d_Rand_constraints_multiple& d) Overload assignement operator |
Decomposition random algorithm generating multiple decomposition matrices
It generates multiple random constrained codes in a selected range. 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