Search the dblp DataBase
Stoyan N. Kapralov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Stoyan N. Kapralov, Svetlana Topalova
Enumeration of 2-(21, 6, 3) Designs with Automorphisms of Order 7 or 5. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1998, v:48, n:, pp:- [Journal] - Stefan M. Dodunekov, Sylvia B. Encheva, Stoyan N. Kapralov
On the [28, 7, 12] Binary Self-Complementary Codes and Their Residuals. [Citation Graph (0, 0)][DBLP]
Des. Codes Cryptography, 1994, v:4, n:1, pp:57-67 [Journal] - Iliya Boukliev, Rumen N. Daskalov, Stoyan N. Kapralov
Optimal quaternary linear codes of dimension five. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1228-1235 [Journal] - Iliya Boukliev, Stoyan N. Kapralov, Tatsuya Maruta, M. Fukui
Optimal linear codes of dimension 4 over F5. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:308-313 [Journal] - Rumen N. Daskalov, Stoyan N. Kapralov
New minimum distance bounds for certain binary linear codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1795-0 [Journal] - Stoyan N. Kapralov, Vladimir D. Tonchev
Extremal doubly-even codes of length 64 derived from symmetric designs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1990, v:83, n:2-3, pp:285-289 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002