Stefan Dodunekov’s 75th birthday
Keywords:
anniversary, Stefan DodunekovAbstract
This year marks the 75th anniversary of Stefan Dodunekov’s birth-a world-renowned scientist, founder of the Coding theory group in Bulgaria, of two international scientific conferences, former Director of the Institute of Mathematics and Informatics, Academician and President of the Bulgarian Academy of Sciences, but most of all a great teacher, friend and person. In this work we present some results on optimal error-correcting codes obtained by Stefan Dodunekov.
References
S. M. Dodunekov. Minimal'naya blokovaya dlina lineynogo q-ichnogo koda s zadannymi razmernost'yu i kodovym rasstoyaniyem. Problemy peredachi informatsii, 20 (1984), No 4, 11–22.
S. M. Dodunekov. Optimalni lineyni kodove. Disertatsiya za prisazhdane na nauchnata stepen ”doktor na matematichskite nauki“, Sofiya, 1985.
S. M. Dodunekov, N. L. Manev. Kharakterizatsiya dvukh klassov kodov, dostigayushchikh granits Graysmera. Problemy peredachi informatsii, 19, 4 (1983), 3–10.
S. M. Dodunekov, N. L. Manev. Utochneniye granitsy Graysmera dlya nekotorykh klassov rasstoyaniy. Problemy peredachi informatsii, 23 (1987), No 1, 47–56.
F. Dzh. MakUilyams, N. Dzh. A. Sloyen. Teoriya kodov ispravlyayushchikh oshibki, Moskva, Svyaz', 1979.
T. Baicheva, S. Dodunekov, R. Kötter. On the Performance of the Ternary [13,7,5] Quadratic-Residue Codes. IEEE Trans. Inform. Theory, 48 (2002), No 2, 562–564.
T. Baicheva, I. Boyukliev. On the ternary projective codes with dimensions 4 and 5. Proc of the International Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, 2004, 34–39.
T. Baicheva, I. Bouyukliev, S. Dodunekov, V. Fack. Binary and Ternary Quasi- perfect Codes with Small Dimensions. IEEE Trans. Inform. Theory, 54 (2008), No 9, 4335– 4339.
I. Bouyukliev. What is Q-extension? Serdica J. Computing, 1 (2007), No 2, 115–130.
I. Bouyukliev. On the binary projective codes with dimension 6. Discrete Applied Mathematics, 154 (2006) 1693–1708.
A. E. Brouwer, M. van Eupen. The corespondence between projective codes and 2- weight codes. Designs, Codes and Cryptography, 11 (1997), No 3, 261–266.
D. Danev, S. Dodunekov. A family of ternary quasi-perfect codes. Proc. International workshop on coding and cryptograph, Versailles, France, 2007.
S. M. Dodunekov. The optimal double-error correcting codes of Zetterberg and Dumer- Zinov’ev are quasiperfect. C. R. Acad. Bulgare Sci, 38 (1985), No 9, 1121–1123.
S. M. Dodunekov. Some quasiperfect double error correcting codes, Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform., 15 (1986), No 5, 367–375.
S. M. Dodunekov. A remark on the weight structure of generating matrices of linear codes. Problems Inform. Transmission, 26 (1990), No 2, 173–176.
S. M. Dodunekov, S. B. Encheva. On the uniqueness of some linear subcodes of the binary extended Golay code. Proc. of the Int. Workshop Algebraic and Combinatorial Coding Theory, Varna, Bulgaria, 1988, 38–40.
S. M. Dodunekov , T. Helleseth, N. L. Manev, Ø. Ytrehus. New bounds on binary linear codes of dimension eight. IEEE Trans. Inform. Theory, 33 (1987), No 6, 917–919.
S. M. Dodunekov, N. L. Manev. An improvement of the Griesmer bound for some small minimum distances. Discrete Appl. Math., 12 (1985), No 2, 103–114.
S. M. Dodunekov, N. L. Manev. An improvement of the Griesmer bound for some classes of distances. IEEE Conf. on Inf. Theory, Brightion, 1985.
S. Dodunekov, J. Simonis. Codes and projective multisets. Electron. J. Combin., 5 (1998), No 1, Research Paper 37, 23 pp.
I. I. Dumer, V. A. Zinov’ev. Some new maximal codes over GF(4), Problems of Information Transmission, 14 (1978), No 3, 174–181.
T. Etzion, B. Mounits. Quasi-perfect codes with small distance. IEEE Trans. Inf. Theory, 51 (2005), No 11, 3938–3946.
I. B. Gashkov, V. M. Sidel’nikov. Linear ternary quasiperfect codes correcting double errors. Problems of Information Transmission, 22 (1986), No 4, 284–288.
D. N. Gevorkijan, A. M. Avetisjan, G. A. Tigranjan. On the construction of codes correcting two errors in Hamming’s metric over Galois field. Vichislitel’naja tehnika, 3 (1975) 19–21 (in Russian).
J. H. Griesmer. A bound for error-correcting codes. IBM J Res. Develop., 4 (1960), 532-542.
R. Hill. Optimal linear codes. In: Cryptography and Coding II (ed. C. Mitchell), Oxford, Oxford University Press, 1992, 75–104.
D. Jaffe. Binary linear codes: new results on nonexistence. Manuscript, Department of mathematics and statistics, University of Nebraska.
A. Tietäväinen. On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math., 24 (1973), 88–96.
V. A. Zinov’ev, V. K. Leont’ev. On non-existence of perfect codes over Galois fields. Probl. Control Inf. Theory, 2 (1973), 16–24; translation from Probl. Upravl. Teor. Inform. 2 (1973), No 2, 123–132.
