|
|
|
Publications in Math-Net.Ru |
Citations |
|
2011 |
| 1. |
R. Daskalov, E. Metodieva, “New $(n,r)$-arcs in $\mathrm{PG}(2,17)$, $\mathrm{PG}(2,19)$, and $\mathrm{PG}(2,23)$”, Probl. Peredachi Inf., 47:3 (2011), 3–9   ; Problems Inform. Transmission, 47:3 (2011), 217–223   |
9
|
|
2007 |
| 2. |
R. N. Daskalov, “Some High Rate Linear Codes over $GF(5)$ and $GF(7)$”, Probl. Peredachi Inf., 43:2 (2007), 65–73  ; Problems Inform. Transmission, 43:2 (2007), 124–131 |
1
|
|
2004 |
| 3. |
R. N. Daskalov, E. Metodieva, “On the Nonexistence of Ternary $[284,6,188]$ Codes”, Probl. Peredachi Inf., 40:2 (2004), 37–49 ; Problems Inform. Transmission, 40:2 (2004), 135–146 |
| 4. |
R. N. Daskalov, E. Metodieva, P. V. Hristov, “New Minimum Distance Bounds for Linear Codes over $GF(9)$”, Probl. Peredachi Inf., 40:1 (2004), 15–26 ; Problems Inform. Transmission, 40:1 (2004), 13–24 |
2
|
|
2003 |
| 5. |
R. N. Daskalov, P. V. Hristov, “New Quasi-Cyclic Degenerate Linear Codes over $GF(8)$”, Probl. Peredachi Inf., 39:2 (2003), 29–35 ; Problems Inform. Transmission, 39:2 (2003), 184–190 |
2
|
|
2002 |
| 6. |
R. Daskalov, P. Khristov, “New One-Generator Quasi-cyclic Codes over $GF(7)$”, Probl. Peredachi Inf., 38:1 (2002), 59–63 ; Problems Inform. Transmission, 38:1 (2002), 50–54 |
9
|
|
2001 |
| 7. |
R. N. Daskalov, T. A. Gulliver, “New Minimum Distance Bounds for Linear Codes over Small Fields”, Probl. Peredachi Inf., 37:3 (2001), 24–33 ; Problems Inform. Transmission, 37:3 (2001), 206–215 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: