Extremal doubly-even codes of length 64 derived from symmetric designs. - Stoyan N. Kapralov; Vladimir D. Tonchev (Discret. Math., 1990)

New minimum distance bounds for certain binary linear codes. - Rumen N. Daskalov; Stoyan N. Kapralov (IEEE Trans. Inf. Theory, 1992)

On the [28, 7, 12] Binary Self-Complementary Codes and Their Residuals. - Stefan M. Dodunekov; Sylvia B. Encheva; Stoyan N. Kapralov (Des. Codes Cryptogr., 1994)

Optimal quaternary linear codes of dimension five. - Iliya G. Bouyukliev; Rumen N. Daskalov; Stoyan N. Kapralov (IEEE Trans. Inf. Theory, 1996)

Optimal linear codes of dimension 4 over F5. - Iliya G. Bouyukliev; Stoyan N. Kapralov; Tatsuya Maruta; Masaharu Fukui (IEEE Trans. Inf. Theory, 1997)

Enumeration of 2-(21, 6, 3) Designs with Automorphisms of Order 7 or 5. - Stoyan N. Kapralov; Svetlana Topalova (Ars Comb., 1998)

Error-Correcting Codes over an Alphabet of Four Elements. - Galina T. Bogdanova; Andries E. Brouwer; Stoyan N. Kapralov; Patric R. J. Östergård (Des. Codes Cryptogr., 2001)

Enumeration of Optimal Ternary Constant-Composition Codes. - Galina T. Bogdanova; Stoyan N. Kapralov (Probl. Inf. Transm., 2003)

Uniqueness of some optimal superimposed codes. - Sungpyo Hong; Stoyan N. Kapralov; Hyun Kwang Kim; Dong Yeol Oh (Probl. Inf. Transm., 2007)

Modeling a System with Discrete Events. - Stoyan N. Kapralov; Valentina Dyankova (EMS, 2012)