80th birth anniversary of Acad. Stefan Dodunekov

Ст. Додунеков, „Оптимални линейни кодове“, дисертация за присъждане на научното звание Доктор на математическите науки, 1985.

T. Baicheva, S. Dodunekov, and P. Kazakov. On the cyclic redundancy-check codes with 8-bit redundancy. Computer Communications 21, no. 11 (1998): 1030-1033.

S. Boumova, P. Boyvalenkov, D. Danev, Necessary conditions for existence of some designs in polynomial metric spaces, Europ. J. Combin. 20, (1999), 213-225.

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

A. Betten, S. Topalova, and S. Zhelezova. Parallelisms of invariant under cyclic groups of order 4. International Conference on Algebraic Informatics. Cham: Springer International Publishing, 2019.

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

I. Bouyukliev, S. Bouyuklieva, and S. Kurz. Computer classification of linear codes. IEEE Transactions on Information Theory 67, no. 12 (2021): 7807-7814.

I. Bouyukliev, Classification of Griesmer codes and dual transform. Discrete mathematics 309, no. 12 (2009): 4049-4068.

I. Bouyukliev and M. Dzhumalieva-Stoeva. Representing equivalence problems for combinatorial objects. Serdica Journal of Computing 8.4 (2014): 327-354.

I. Bouyukhev, D. Jaffe, and V. Vavrek. The smallest length of eightdimensional binary linear codes with prescribed minimum distance. IEEE Transactions on Information Theory 46.4 (2002): 1539-1544.

S. Bouyuklieva. Optimal binary LCD codes. Designs, Codes and Cryptography 89, no. 11 (2021): 2445-2461.

S. Bouyuklieva, Self-dual codes, In Concise Encyclopedia of Coding Theory, Chapman and Hall/CRC, 79–96, 2021.

S. Bouyuklieva and I. Bouyukliev, An Algorithm for Classification of Binary Self-Dual Codes, IEEE Transactions on Information Theory, 58(6) (2012), 3933- 3940.

S. Bouyuklieva, I. Bouyukliev, and F. O¨ zbudak. Sequence of numbers of linear codes with increasing hull dimensions. Designs, Codes and Cryptography 94, no. 2 (2026): 39.

S. Bouyuklieva, and Javier de la Cruz. On the structure of binary LCD codes having an automorphism of odd prime order. IEEE Transactions on Information Theory 68, no. 10 (2022): 6426-6433.

S. Bouyuklieva and M. Harada, On Type IV self-dual codes over Z4, Discrete Mathematics 247 (2002), 25-50.

S. Bouyuklieva, R. Russeva, and N. Yankov. On the structure of binary selfdual codes having an automorphism of order a square of an odd prime. IEEE Trans. Inform. Theory 51, no. 10 (2005): 3678–3686.

P. Boyvalenkov, Extremal polynomials for obtaining bounds for spherical codes and designs, Discr. Comput. Geom. 14 (1995), 167–183.

P. Boyvalenkov and D. Danev, Linear Programming Bounds, In Concise Encyclopedia of Coding Theory, Chapman and Hall/CRC, 79–96, 2021.

P. Boyvalenkov and D. Danev, On linear programming bounds for codes in polynomial metric spaces, Probl. Peredachi Inf., 34(2) (1998), 16-31 (in Russian); English translation in Probl. Inform. Transm. 34(2) (1998), 108–120.

P. Boyvalenkov, D. Danev, and S. Bumova, Upper bounds on the minimum distance of spherical codes, IEEE Trans. Inform. Theory, 42 (1996), 1576–1581.

P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, and M. Stoyanova, Universal lower bounds for potential energy of spherical codes, Constructive Approximation 44 (2016), 385-415.

P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, and M. Stoyanova, Energy bounds for codes and designs in Hamming spaces, Designs, Codes and Cryptography 82(1) (2017), 411–433.

P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, and M. Stoyanova, On polarization of spherical codes and designs, Journal of Mathematical Analysis and Applications, 524(2) (2023), art. 127065 (29 pages).

P. Boyvalenkov, D. Cherkashin, The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000, Results in Mathematics, 80(1) (2025), art. 3 (12 pages).

P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, and M. Stoyanova, Universal minima of discrete potentials for sharp spherical codes, Revista Matematica Iberoamericana, 41(2) (2025), 603–650.

P. Boyvalenkov, S. Nikova, On lower bounds on the size of designs in compact symmetric spaces of rank 1, Archiv der Mathematik 68 (1997), 81–88.

P. Boyvalenkov, M. Stoyanova, New nonexistence results for spherical designs, Advances in Mathematics of Communications 7(4) (2013), 279–292.

D. Danev, S. Dodunekov. A family of ternary quasi-perfect BCH codes. Designs, Codes and Cryptography, 49 (2008), No 1, 265–271.

S. Dodunekov, K. Manev, V. Tonchev. On the covering radius of binary (14,6) codes containing the all-one vector. IEEE Trans. Inform. Theory, IT-34 (1988), No. 3, 591–595.

S. Dodunekov, I. Landjev. On near-MDS codes. Journal of Geometry, 54 (1995), 30–43.

S. Dodunekov, I. Landjev. Near-MDS Codes over some small fields, Discrete Mathematics, 213 (2000), 55–65.

S. Dodunekov, T. Ericson, V. A. Zinoviev. Concatenation Methods for Construction of Spherical Codes in N-dimensional Euclidean space. Problems of Information Transmission, 27 (1991), No. 4, 34–38.

R. Dodunekova, S. Dodunekov, and E. Nikolova. A survey on proper codes. Discrete applied mathematics 156, no. 9 (2008): 1499-1509.

R. Dontcheva, A. J. van Zanten, and Stefan M. Dodunekov. Binary self-dual codes with automorphisms of composite order. IEEE Transactions on Information Theory 50, no. 2 (2004): 311-318.

T. Honold, I. Landjev, Linear Codes over Finite Chain Rings, Electronic Journal of Combinatorics 7, (2000), R11.

T. Honold, I. Landjev, Codes over rings and ring geometries, Chapter 7. In: De Beule J., Storme L. (eds.) Current research topics in Galois geometries, pp. 161–186. Nova Science Publishers, New York (2012).

T. Alexandrova, H. Kostadinov, and N. Manev. "General construction of integer codes correcting single error in t2-TQAM."Computers and Electrical Engineering 127 (2025): 110572.

I. Landjev, E. Rogachev, Sperner’s theorem for non-free modules over finite chain rings. Des. Codes Cryptogr. 93, 373–390 (2025).

I. Landjev, E. Rogachev, A. Rousseva, Characterization of some minihypers in PG(r, 3) and the nonexistence of some ternary Griesmer codes. Des. Codes Cryptogr. 94, 22 (2026).

I. Landjev, L. Storme, Galois geometries and coding theory, Current Research Topics in Galois Geometry, pp. 187 – 214, (2011).

M. Markov, and Yuri Borissov. The weight distribution of the fourth-order Reed–Muller code of length 512. Designs, Codes and Cryptography 93, no. 7 (2025): 2487-2502.

P. O¨stergard, Tsonka Baicheva, and Emil Kolev. Optimal binary one-errorcorrecting codes of length 10 have 72 codewords. IEEE Transactions on Information Theory 45, no. 4 (1999): 1229-1231.

M. Pashinska-Gadzheva, and I. Bouyukliev. “Algorithm 1059: LinCodeWeightInv—Library for Computing the Weight Distribution of Linear Codes over Finite Fields.” ACM Transactions on Mathematical Software 51, no. 4 (2025): 1-22.

A. Rousseva, I. Landjev, The geometric approach to the existence of some quaternary Griesmer codes. Des. Codes Cryptogr. 88, 1925–1940 (2020).

A. Rousseva, I. Landjev, Linear codes close to the Griesmer bound and the related geometric structures. Des. Codes Cryptogr. 87, 841–854 (2019).

V. Tonchev, On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs. Designs, Codes and Cryptography 90, no. 11 (2022): 2753-2762.

V. Tonchev, Codes and Designs. In Concise Encyclopedia of Coding Theory, Chapman and Hall/CRC, 79–96, 2021.

S. Topalova, and S. Zhelezova. On point-transitive and transitive deficiency one parallelisms of PG(3, 4). Designs, Codes and Cryptography 75.1 (2015): 9-19.

S. Topalova, and S. Zhelezova. Isomorphism and invariants of parallelisms of projective spaces. In International Congress on Mathematical Software, pp. 162-172. Cham: Springer International Publishing, 2020.