class d_Rand |
Random decomposition algorithm without constraints.
![]() | d_Rand () Dummy constructor |
![]() | d_Rand (unsigned nclass, unsigned ndico, unsigned min_dicho_dist = 1) Constructor |
![]() | d_Rand (char* file) Constructor |
![]() | d_Rand (const d_Rand& d) Copy constructor |
![]() | operator= (const d_Rand& d) Overload assignement operator |
Decomposition random algorithm without constraints
It generates random constrained codes using random generation. 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