Cybernetics and Information Technologies
Special Thematic Issue on Optimal Codes and Related Topics
À propos de cet article
Publié en ligne: 26 mai 2018
Pages: 44 - 53
Reçu: 30 sept. 2017
Accepté: 21 déc. 2017
DOI: https://doi.org/10.2478/cait-2018-0019
Mots clés
© 2018 Iliya Bouyukliev et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
The classification of combinatorial objects consists of two sub-problems – construction of objects with given properties and rejection of isomorphic objects. In this paper, we consider generation of combinatorial objects that are uniquely defined by a matrix. The method that we present is implemented by backtrack search. The used approach is close to dynamic programming.