The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Iliya Bouyukliev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Iliya Bouyukliev
    On the binary projective codes with dimension 6. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:12, pp:1693-1708 [Journal]
  2. Iliya Bouyukliev, Juriaan Simonis
    Some New Results on Optimal Codes Over F5. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:30, n:1, pp:97-111 [Journal]
  3. Iliya Bouyukliev, Veerle Fack, Wolfgang Willems, Joost Winne
    Projective two-weight codes with small parameters and their corresponding graphs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:41, n:1, pp:59-78 [Journal]
  4. Iliya Bouyukliev, Markus Grassl, Zlatko Varbanov
    New bounds for n4(k, d) and classification of some optimal codes over GF(4). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:43-66 [Journal]
  5. Iliya Bouyukliev, David B. Jaffe
    Optimal binary linear codes of dimension at most seven. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:51-70 [Journal]
  6. Iliya Bouyukliev, Patric R. J. Östergård
    Classification of Self-Orthogonal Codes over F3 and F4. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:363-370 [Journal]
  7. Iliya Bouyukliev, Sugi Guritman, Vesselin Vavrek
    Some bounds for the minimum length of binary linear codes of dimension nine. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1053-1056 [Journal]
  8. Iliya Bouyukliev, David B. Jaffe, Vesselin Vavrek
    The smallest length of eight-dimensional binary linear codes with prescribed minimum distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1539-1544 [Journal]
  9. Iliya Bouyukliev, Juriaan Simonis
    Some new results for optimal ternary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:981-985 [Journal]
  10. Iliya Bouyukliev, Zlatko Varbanov
    Some results for linear binary codes with minimum distance 5 and 6. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:12, pp:4387-4391 [Journal]

  11. Results on Binary Linear Codes With Minimum Distance 8 and 10 [Citation Graph (, )][DBLP]


  12. A method for efficiently computing the number of codewords of fixed weights in linear codes. [Citation Graph (, )][DBLP]


  13. 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. [Citation Graph (, )][DBLP]


  14. Classification of Griesmer codes and dual transform. [Citation Graph (, )][DBLP]


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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002