The SCEAS System
| |||||||

## Search the dblp DataBase
Iliya Bouyukliev:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Iliya Bouyukliev, Juriaan Simonis
**Some New Results on Optimal Codes Over F**[Citation Graph (0, 0)][DBLP]^{5}. Des. Codes Cryptography, 2003, v:30, n:1, pp:97-111 [Journal] - 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] - Iliya Bouyukliev, Markus Grassl, Zlatko Varbanov
**New bounds for n4(**[Citation Graph (0, 0)][DBLP]*k, d*) and classification of some optimal codes over GF(4). Discrete Mathematics, 2004, v:281, n:1-3, pp:43-66 [Journal] - 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] - Iliya Bouyukliev, Patric R. J. Östergård
**Classification of Self-Orthogonal Codes over F**[Citation Graph (0, 0)][DBLP]_{3}and F_{4}. SIAM J. Discrete Math., 2005, v:19, n:2, pp:363-370 [Journal] - 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] - 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] - 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] - 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] **Results on Binary Linear Codes With Minimum Distance 8 and 10**[Citation Graph (, )][DBLP]**A method for efficiently computing the number of codewords of fixed weights in linear codes.**[Citation Graph (, )][DBLP]**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]**Classification of Griesmer codes and dual transform.**[Citation Graph (, )][DBLP]
Search in 0.049secs, Finished in 0.050secs | |||||||

| |||||||

| |||||||

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