Stoyan N. Kapralov

According to our database, Stoyan N. Kapralov authored at least 10 papers between 1990 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Modeling a System with Discrete Events.

Stoyan N. Kapralov, Valentina Dyankova

Proceedings of the Sixth UKSim/AMSS European Symposium on Computer Modeling and Simulation, 2012

2007

Uniqueness of some optimal superimposed codes.

Sungpyo Hong, Stoyan N. Kapralov, Hyun Kwang Kim, Dong Yeol Oh

Probl. Inf. Transm., 2007

2003

Enumeration of Optimal Ternary Constant-Composition Codes.

Galina T. Bogdanova, Stoyan N. Kapralov

Probl. Inf. Transm., 2003

2001

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

1998

Enumeration of 2-(21, 6, 3) Designs with Automorphisms of Order 7 or 5.

Stoyan N. Kapralov, Svetlana Topalova

Ars Comb., 1998

1997

Optimal linear codes of dimension 4 over F₅.

Iliya G. Bouyukliev, Stoyan N. Kapralov, Tatsuya Maruta, Masaharu Fukui

IEEE Trans. Inf. Theory, 1997

1996

Optimal quaternary linear codes of dimension five.

Iliya G. Bouyukliev, Rumen N. Daskalov, Stoyan N. Kapralov

IEEE Trans. Inf. Theory, 1996

1994

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

1992

New minimum distance bounds for certain binary linear codes.

Rumen N. Daskalov, Stoyan N. Kapralov

IEEE Trans. Inf. Theory, 1992

1990

Extremal doubly-even codes of length 64 derived from symmetric designs.

Stoyan N. Kapralov, Vladimir D. Tonchev

Discret. Math., 1990