About an Approach for Constructing Combinatorial Objects

1. Bouyukliev, I. “Q-EXTENSION” – Strategy in Algorithms. – In: Proc. of International Workshop ACCT, Bansko, Bulgaria, 2000, pp. 84-89.Search in Google Scholar

2. Bouyuklieva, S., I. Bouyukliev. An Algorithm for Classifcation of Binary Self-Dual Codes. – IEEE Trans. Inform. Theory, Vol. 58, 2012, pp. 3933-3940.10.1109/TIT.2012.2190134Search in Google Scholar

3. Brinkmann, G. Generating Regular Directed Graphs. – Discrete Mathematics, Vol. 313, 2013, pp. 1-7.10.1016/j.disc.2012.09.014Search in Google Scholar

4. Bulutoglu, D. A., F. Margot. Classification of Orthogonal Arrays by Integer Programming. – Journal of Statistical Planning and Inference, Vol. 138, 2008, pp. 654-666.10.1016/j.jspi.2006.12.003Search in Google Scholar

5. Dzhumalieva-Stoeva, M., I. Bouyulkiev, V. Monev. Construction of Self-Orthogonal Codes from Combinatorial Designs. – Problems of Information Transmissions, Vol. 48, 2012, No 3, pp. 250-258.10.1134/S0032946012030052Search in Google Scholar

6. Hedayat, A. S., N. J. A. Sloane, J. Stufken. Orthogonal Arrays: Theory and Applications. Springer, 1999.10.1007/978-1-4612-1478-6Search in Google Scholar

7. Kaski, P., P. R. J. Östergard. Classification Algorithms for Codes and Designs. – Berlin, Heidelberg, Springer-Verlag, 2006.Search in Google Scholar

8. McKay, B. D. Isomorph-Free Exhaustive Generation. – J. Algorithms, Vol. 26, 1998, pp. 306-324.10.1006/jagm.1997.0898Search in Google Scholar

9. Schoen, E. D., P. T. Eendebak, M. V. M. Nguyen. Complete Enumeration of Pure-Level and Mixed-Level Orthogonal Arrays. – Journal of Combinatorial Designs, Vol. 18, 2009, pp. 123-140.10.1002/jcd.20236Open DOISearch in Google Scholar