What is Q-extension? I Bouyukliev Serdica Journal of Computing 1 (2), 115-130, 2007 | 51 | 2007 |

About the code equivalence I Bouyukliev Ser. Coding Theory Cryptol 3, 126-151, 2007 | 50 | 2007 |

Extremal self-dual codes with an automorphism of order 2 S Buyuklieva, N Boukliev IEEE Transactions on Information Theory 44 (1), 323-328, 1998 | 39 | 1998 |

An algorithm for classification of binary self-dual codes S Bouyuklieva, I Bouyukliev arXiv preprint arXiv:1106.5930, 2011 | 31 | 2011 |

Projective two-weight codes with small parameters and their corresponding graphs I Bouyukliev, V Fack, W Willems, J Winne Designs Codes and Cryptography 41 (1), 59-78, 2006 | 30 | 2006 |

Some new results for optimal ternary linear codes I Bouyukliev, J Simonis IEEE Transactions on Information Theory 48 (4), 981-985, 2002 | 29 | 2002 |

Optimal linear codes of dimension 4 over F/sub 5 I Boukliev, S Kapralov, T Maruta, M Fukui IEEE Transactions on Information Theory 43 (1), 308-313, 1997 | 29 | 1997 |

Classification of optimal binary self-orthogonal codes I Bouyukliev, S Bouyuklieva, TA Gulliver, PRJ Ostergard Journal of Combinatorial Mathematics and Combinatorial Computing 59, 33, 2006 | 28 | 2006 |

Classification of Self-Orthogonal Codes over\boldmath \F_3 and\boldmath \F_4 I Bouyukliev, PRJ Östergard SIAM Journal on Discrete Mathematics 19 (2), 363-370, 2005 | 25 | 2005 |

Some new extremal self-dual codes with lengths 44, 50, 54, and 58 I Boukliev, S Buyuklieva IEEE Transactions on Information Theory 44 (2), 809-812, 1998 | 21 | 1998 |

Optimal binary linear codes of dimension at most seven I Bouyukliev, DB Jaffe Discrete Mathematics 226 (1-3), 51-70, 2001 | 19 | 2001 |

2-(31, 15, 7), 2-(35, 17, 8) and 2-(36, 15, 6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes I Bouyukliev, V Fack, J Winne Designs, Codes and Cryptography 51 (2), 105, 2009 | 17 | 2009 |

The smallest length of eight-dimensional binary linear codes with prescribed minimum distance I Bouyukhev, DB Jaffe, V Vavrek IEEE Transactions on Information Theory 46 (4), 1539-1544, 2000 | 17 | 2000 |

A method for efficiently computing the number of codewords of fixed weights in linear codes I Bouyukliev, V Bakoev Discrete applied mathematics 156 (15), 2986-3004, 2008 | 15 | 2008 |

New bounds for n4 (k, d) and classification of some optimal codes over GF (4) I Bouyukliev, M Grassl, Z Varbanov Discrete mathematics 281 (1-3), 43-66, 2004 | 15 | 2004 |

Q-extension–strategy in algorithms I Bouyukliev Proc. of the 7th International Workshop on Algebraic and Combinatorial …, 2000 | 15 | 2000 |

Some New Results on Optimal Codes Over F^{5}I Bouyukliev, J Simonis Designs, Codes and Cryptography 30 (1), 97-111, 2003 | 14 | 2003 |

On the binary projective codes with dimension 6 I Bouyukliev Discrete applied mathematics 154 (12), 1693-1708, 2006 | 13 | 2006 |

Binary and ternary linear quasi-perfect codes with small dimensions T Baicheva, I Bouyukliev, S Dodunekov, V Fack IEEE transactions on information theory 54 (9), 4335-4339, 2008 | 12 | 2008 |

Hadamard matrices of order 36 and double-even self-dual [72, 36, 12] codes I Bouyukliev, V Fack, J Winne Proceedings of EuroComb 2005, 93-98, 2005 | 12 | 2005 |