|
|
|
Publications in Math-Net.Ru |
Citations |
|
2007 |
| 1. |
I. Boukliev, S. Bouklieva, S. M. Dodunekov, “On the Binary Self-complementary $[120,9,56]$ Codes Having an Automorphism of Order 3 and Associated SDP Designs”, Probl. Peredachi Inf., 43:2 (2007), 25–33   ; Problems Inform. Transmission, 43:2 (2007), 89–96   |
4
|
|
2006 |
| 2. |
L. A. Bassalygo, S. M. Dodunekov, V. A. Zinov'ev, T. Helleseth, “The Gray–Rankin
Bound for Nonbinary Codes”, Probl. Peredachi Inf., 42:3 (2006), 37–44 ; Problems Inform. Transmission, 42:3 (2006), 197–203 |
7
|
|
2004 |
| 3. |
R. D. Dodunekova, S. M. Dodunekov, E. Nikolova, “On the Error-Detecting Performance of Some Classes of Block Codes”, Probl. Peredachi Inf., 40:4 (2004), 68–78  ; Problems Inform. Transmission, 40:4 (2004), 356–364 |
4
|
|
1999 |
| 4. |
S. M. Dodunekov, V. A. Zinov'ev, J. Nilsson, “On Algebraic Decoding of Some Maximal Quaternary Codes and the Binary Golay Code”, Probl. Peredachi Inf., 35:4 (1999), 59–67 ; Problems Inform. Transmission, 35:4 (1999), 338–345 |
1
|
|
1995 |
| 5. |
S. M. Dodunekov, J. Nilsson, “On the Decoding of Some Exceptional Ternary Codes”, Probl. Peredachi Inf., 31:2 (1995), 36–43 ; Problems Inform. Transmission, 31:2 (1995), 128–134 |
1
|
|
1993 |
| 6. |
S. M. Dodunekov, S. B. Encheva, A. N. Ivanov, “New Bounds for the Minimum Length of Binary Linear Block Codes”, Probl. Peredachi Inf., 29:2 (1993), 41–47 ; Problems Inform. Transmission, 29:2 (1993), 132–139 |
2
|
| 7. |
S. M. Dodunekov, S. B. Encheva, “Uniqueness of Some Linear Subcodes of the Extended Binary Golay Code”, Probl. Peredachi Inf., 29:1 (1993), 45–51 ; Problems Inform. Transmission, 29:1 (1993), 38–43 |
8
|
|
1991 |
| 8. |
S. M. Dodunekov, V. A. Zinov'ev, T. Ericson, “Concatenation Method for Construction of Spherical Codes in $n$-Dimensional Euclidean Space”, Probl. Peredachi Inf., 27:4 (1991), 34–38 ; Problems Inform. Transmission, 27:4 (1991), 303–307 |
2
|
|
1990 |
| 9. |
S. M. Dodunekov, “A Comment on the Weight Structure of Generator Matrices of Linear Codes”, Probl. Peredachi Inf., 26:2 (1990), 101–104 ; Problems Inform. Transmission, 26:2 (1990), 173–176 |
5
|
|
1987 |
| 10. |
S. M. Dodunekov, “Greismer Codes with Maximum Covering Radius”, Probl. Peredachi Inf., 23:4 (1987), 110–113 ; Problems Inform. Transmission, 23:4 (1987), 344–346 |
1
|
| 11. |
S. M. Dodunekov, N. L. Manev, “An Improvement of Greismer Bound for Some Classes of Distances”, Probl. Peredachi Inf., 23:1 (1987), 47–56 ; Problems Inform. Transmission, 23:1 (1987), 38–46 |
3
|
|
1984 |
| 12. |
S. M. Dodunekov, “Minimum Block Length of a Linear $q$-ary Code with Specified Dimension and Code Distance”, Probl. Peredachi Inf., 20:4 (1984), 11–22 ; Problems Inform. Transmission, 20:4 (1984), 239–249 |
20
|
| 13. |
S. M. Dodunekov, N. L. Manev, “Minimum Possible Block Length of a Linear Binary Code for Some Distances”, Probl. Peredachi Inf., 20:1 (1984), 12–18 ; Problems Inform. Transmission, 20:1 (1984), 8–14 |
3
|
|
1983 |
| 14. |
S. M. Dodunekov, N. L. Manev, “Characterization of Two Classes of Codes that Attain the Griesmer Bound”, Probl. Peredachi Inf., 19:4 (1983), 3–10 ; Problems Inform. Transmission, 19:4 (1983), 253–259 |
3
|
|
1981 |
| 15. |
S. M. Dodunekov, V. I. Yorgov, “Note on the Weight Distribution for Constacyclic Codes”, Probl. Peredachi Inf., 17:2 (1981), 102–103 |
|
1980 |
| 16. |
S. M. Dodunekov, V. I. Yorgov, “Distribution of Weights of Irreducible Cyclic Codes and Strongly Regular Graphs”, Probl. Peredachi Inf., 16:2 (1980), 33–39 ; Problems Inform. Transmission, 16:2 (1980), 105–110 |
2
|
|
| Organisations |
|
| |
|
|
Contact us: