175 Suhodolska Street, 1373 Sofia, BULGARIA, Tel./ Fax: +359 2 80 29 188, 802 91 91, e-mail: vsu@vsu.bg, web: www.vsu.bg
bg
Български
facebook   my.vsu.bg   Поща
Mechanics and Mathematics Проф. д-р инж. Партов Prof. Dr. Eng. Kazakov Проф. д-р инж. Банков Assoc. Prof. PhD. Eng. Ivanov Доц. д-р инж. Апостолов Гл. ас. инж. Вайсилов Доц. д-р инж. Гочев Гл. ас. инж. Греков Гл. ас. инж. Ганчев Гл. ас. инж. Петков Assist. Prof. PhD. Eng. Stoynova проф. д-р инж. Рангелов Assoc. Prof. PhD. Angelova Prof. Dr. Davidov Prof. Dr. Dimitrov Assoc. Prof. PhD. Milousheva Assoc. Prof. PhD. Kanchev Assoc. Prof. PhD. Encheva Доц. д-р Манев Гл. ас. д-р Бумова Гл. ас. Зарева Assist. Prof. Staneva

Николай Лазаров Манев
Лични данни

Научно звание

доцент

Служебен адрес

ВСУ "Л. Каравелов", ул. Суходолска 175, 1373 София

Телефон

(+359 2) 80 29 124; (+359 2) 979 28 21

e-mail

nlmanev@math.bas.bg
Образование

юни 1984

Институт по математика и информатика, БАН

Научна специалност

01.01.02 Алгебра

(дисертация: "Граница на Грийсмър и оптимални кодове")

Степен

доктор

1972 - 1977

СУ “Св. Климент Охридски”, ФМИ

Специалност

Математика; специализация - Алгебра

Степен

магистър
Професионална реализация

2012 –

ВСУ „Л. Каравелов”

 

доцент

2007 – 2012

Институт по математика и информатика при БАН

 

доцент, ръководител секция

2000 – 2007

Институт по математика и информатика при БАН

 

зам. директор, доцент

1997 - 2000

Институт по математика и информатика при БАН

 

научен секретар на института

1992 - 1995

ФМИ на ВТУ „Св. Св. Кирил и Методи”

 

Зам. Декан по учебните въпроси, доцент (съвместител)

1990 - 1997

Институт по математика и информатика при БАН

 

доцент

1977 - 1990

Институт по математика и информатика при БАН; СУ “Св. Климент Охридски”

 

асистент – главен асистент

Научни интереси

теория на кодирането, криптография, компютърна алгебра, комуникации, Монте Карло методи, грид и уеб технологии, компютърна сигурност

Членство в професионални организации

American Mathematical Society,

Mathematical Аassociation of America,

IEEE - Information Theory, Computer, and Communication Societies.

Водени лекционни курсове

ЛААГ

Математически анализ - 2

Теория на кодирането, Криптография, Сигурност в компютърни мрежи, Теория на комуникациите, Линейна алгебра, Алгебра (групи, пръстени, полета), Теория на числата, Компютърна алгебра, и др.

Участие в научноизследователски проекти

Ръководител на 2 международни и 3 национални проекта; участник в 8 национални проекта

Участие в международни научни конференции

  • Председател (на 11) или член на организационен или програмен комитет на 18 международни конференции у нас и в чужбина.

  • 42 доклада на международни конференции

Специализации

  • 1985 в ИППИ – РАН, Москва

  • гост-преподавател и гост-изследовател в Chonbuk university, Chonju, South Korea (2007); University of Electro-Comunications - Tokyo (2000); University of Linkoeping (1992,1997); TU of Braunschweig (1994); UEA - Norwich (1993);

НАУЧНИ ПУБЛИКАЦИИ:

  1. N. L. Manev, The Varshamov-Gilbert bound and GBCH codes. Comptes rendus de l'Academie bulgare des Sciences, 30(1977), no.8, pp. 1089-1092. MR 58 #20791
  2. N. L. Manev, Extension of Varshamov-Gilbert bound for burst-correcting codes with fixed distance. Comptes rendus de l’Academie bulgare des Sciences, 31 (1978), no.3, pp. 277-280. MR 58 # 20792
  3. N. L. Manev, Extension of Varshamov-Gilbert bound under arbitrary additive metric for burst-correcting codes. Comptes rendus de l'Academie ulgare des Sciences, 32 (1979), no.7, pp. 863-866. MR 81h #94022
  4. S. Dodunekov, N.L. Manev, Characterization theorems for two classes of codes meeting the Griesmer bound. Comptes rendus de l'Academie bulgare des Sciences, 35 (1982), no.6, pp. 751-752. MR 84c #94009
  5. S. Dodunekov, N. L. Manev, Характеризация двух классов кодов достигающих граница Грайсмера (A characterization of two classes of codes meeting the Griesmer bound), Problemy Peredachi informatsii, 19 (1983), no.4, pp. 3-10. MR 86h #94019.
  6. S. Dodunekov, N. L. Manev, Минимально возможная блоковая длина линейного двоичного кода для некоторых расстояний (Minimal possible block length of a linear binary code for some minimum distances), Problemy Peredachi informatsii, 20 (1984), no.1, pp. 12-18. MR 86i #94048.
  7. N.L. Manev, Граница на Грайсмер и оптимални кодове. (Griesmer bound and optimal codes), Author abstract of the Ph.D. Thesis, 1984.
  8. N.L. Manev, A characterization up to isomorphism of some classes of codes meeting the Griesmer bound. Proc. of the 6-th Intern. Symp. on Inform. Theory, Tashkent, 1984.
  9. N.L. Manev, A characterization up to isomorphism of some classes of codes meeting the Griesmer bound. Comptes rendus de l'Academie bulgare des Sciences, 37 (1984), no.4, pp. 481-483. MR 85m #94029.
  10. S. Dodunekov, N.L. Manev, An improvement of the Griesmer bound for small minimum distance. Discrete Applied Mathematics, 12 (1985), no.2, pp. 103-114. MR 86k #94030.
  11. S. Dodunekov, N. L. Manev, An improvement of the Griesmer bound for some classes of distances. Intern.Symp. of IEEE on Inf. Theory, Brighton, 1985.
  12. S. Dodunekov, N.L. Manev, Linear binary codes with minimum possible length, Proc. of the 10th Prague Conference on Inform. Theory, 1986.
  13. N.L. Manev, On the uniques of certain codes meeting the Griesmer bound. PLISKA Studia mathematica bulgarica, 8 (1986), pp. 47-53. MR 87m #94028.
  14. N. L. Manev, Algorithm for solving quartic equations over, GF(2m), Proceedings of the International Symp. on Information Theory, October 6-9, 1986, Ann Arbor, USA.
  15. S. Dodunekov, N.L. Manev, Some optimal binary codes with dimension 8; Proceed. of the Intern. Symp. on Inform. Theory, October 6-9, 1986, Ann Arbor, USA.
  16. S.Dodunekov, N.L. Manev, The covering radius of optimal binary [15,6,6] codes. Third International Workshop on Information Theory, Sochi, 1987, Proceedings.
  17. S. Dodunekov, N. L. Manev, Уточнение границы Грайсмера для некоторых классов расстояний (An improvement of the Griesmer bound for some classes of distances) Problemy Peredachi informatsii, 23 (1987), no.1, pp. 47-56. MR 88f #94037.
  18. S. Dodunekov, T. Helleseth, N.L. Manev, O. Ytrehus, New bounds on binary linear codes of dimension eight. IEEE Trans. on Inform. Theory, IT-33 (1987), no.6, pp. 917-919. MR 89f #94021.
  19. S. Dodunekov, N.L. Manev, On the minimum distance of binary linear codes with the smallest possible covering radius. Annuaire de l'Universite de Sofia "Kliment Ohridski", 81 (1987), pp.
  20. S. Dodunekov, N. L. Manev, Еrror-control coding for data commu-nications. Journal of new generation computer systems, v.3, 1990, no.4, p.301.
  21. B. Kostova, N. L. Manev, A [25,8,10] does not exist. Comptes rendus de l'Academie bulgare des Sciences, 43 (1990), no.3, pp. 41-44.
  22. E. Kolev, N.L. Manev, The binary weight distribution of an extended [2m, 5] Reed-Solomon code and its dual. Comptes rendus de l'Academie bulgare des Sciences, 43 (1990), no.9, pp. 14-19.
  23. E. Kolev, N. L. Manev, The binary weight distribution of an extended [2m, 5] Reed-Solomon code and its dual. Proc. of II Intern. Workshop on Algebraic and Combinatorial Theory, 16-22 September 1990, Leningrad.
  24. N. L. Manev, S. Topalova, Software system for testing Reed-Solomon codes in different channel, Proceedings of XXI Spring Conference of Union of Bulgarian Mathematicians, April 3-6, 1992.
  25. E.Kolev, N.L.Manev, On the binary distribution of extended Reed-Solomon codes, Proc. of VI Joint Swedish-Russian International Workshop, August 22-27, 1993, Molle, Sweden.
  26. Y. Borissov, N. L. Manev, Some remarks on Bossert-Mahr-Heilig scheme, Proceeding of IV Int. Workshop on Algebraic and Combinatorial Theory, September 11-17, 1994, Novgorod, pp.44-48.
  27. S. Ilieva, N.L.Manev, Error-correcting pairs for binary cyclic codes of length 63 and 65, Proceeding of IV Int. Workshop on Algebraic and Combinatorial Theory, September 11-17, 1994, Novgorod, pp.102-106.
  28. E.Kolev, N.L.Manev, The binary weight distribution of concatenated codes based on Reed-Solomon codes, Proceeding of IV Int. Workshop on Algebraic and Combinatorial Theory, September 11-17, 1994, Novgorod, pp.116-121.
  29. Е. Колев, Н. Л. Манев, Двоичный весовой спектр разширеного [2m,5]-кода Рида-Соломона и дуального кода, Проблемы передачи информации (Problemy Peredachi informatsii), 30 (1994), no. 3, 38-46.
  30. Y. Borissov, N.L.Manev, On the minimal words of the primitive BCH codes, Proceeding of V Int. Workshop on Algebraic and Combinatorial Theory, June 1-7, 1996, Sozopol, pp. 59-65.
  31. Y. Borissov, N.L.Manev, On the minimal words of the primitive BCH codes, Proceeding of 1997 IEEE International Symposium on Information Theory, June 29 - July 4, 1997, Ulm, Germany, p. 86.
  32. Y. Borissov, N.L.Manev, A note on the Stern's syndrome identification scheme, Proceedings of XXVI Spring Conference of Union of Bulgarian Mathematicians, April, 1997.
  33. Y. Borissov, N.L.Manev, Minimal codewords of weight 10 in the cyclic code with generating polynomial m1(x)m5(x), Proceedings of XXVII Spring Conference of Union of Bulgarian Mathematicians, April, 1998, pp. 183-189.
  34. N.L.Manev, Error-correcting codes in cryptography (Invited lecture), Proceedings of XXVII Spring Conference of Union of Bulgarian Mathematicians, April, 1998, pp. 48-62
  35. Y. Borissov, N.L.Manev, Minimal codewords in binary cyclic codes of length 31, Proceed. of the II Intern. Workshop on Optimal Codes and Related Topics , 1998, pp. 19-27.
  36. Ю. Борисов, Н.Л. Манев, Минимальные кодовые слова примитивного кода БЧХ, Проблемы передачи информации, т. 34 (1998), вып. 3, стр. 37-46.
  37. N.L.Manev, Y. Borissov, On the minimal codewords in some classes of cyclic codes, Proceedings of the VI Intern. Workshop on Algebraic and Combinatorial Coding Theory, Pskov, Russia, Sept. 6-12, 1998, pp. 187-190.
  38. N. L. Manev, Cryptography and Network Security, Swedish-Bulgarian Workshop ‘Information Security in the 21st Century: Global Convergence”, September 18-25, Bansko.
  39. T. Nikolov, N. L. Manev, On the binary complementary sequences, Proceeding of the VII International Workshop on Algebraic and Combinatorial Coding Theory, 2000, pp. 245-250.
  40. Y. Borissov, N. L. Manev, S. Nikova, "On the non-minimal codewords of weight 2d_min in the binary Reed-Muller code", Proc. of the International Workshop on Coding and Cryptography, Paris, January 8-12, 2001, Electronic Notes in Discrete Mathematics, Elsevier, vo. 6, pp. 103-110, 2001
  41. Y. Borissov, N. L. Manev, S. Nikova, On the non-minimal codewords in the binary Reed-Muller code, Proc. of the IEEE International Symposium on Information Theory ISIT2001, Washington DC, June 24-29, 2001
  42. Y. Borissov, N. L. Manev, S. Nikova, "On the non-minimal codewords of weight 2d_min in the binary Reed-Muller code", Discrete Applied Mathematics, vol 128 (2003), no.1 pp. 65-74.
  43. H.Kostadinov, H.Morita, N.Manev, On coded modulation based on finite rings of integers, Proceedings of ISIT 2003, Yokohama, Japan, June 29 - July 4, 2003, p. 156.
  44. H. Kostadinov, H. Morita, N. Manev, Integer codes correcting single errors of specific types (±e1, ±e2, … , ±es), IEICE Trans. Fundamentals, vol. E86-A, no. 7 July 2003, pp. 1843-1849.
  45. Y. Borissov, N.L. Manev, “Minimal Codewords in Linear Codes”, Serdica, vol. 30 (2004), no. 2-3, pp. 303 – 324
  46. H. Kostadinov, H. Morita, N.L. Manev, “Derivation on Bit Error Probability of Coded QAM using Integer Codes”, Proceedings of ISIT 2004, Chicago, USA June 26 -July 4, 2004, p. 540.
  47. H. Kostadinov, H. Morita, N. L. Manev, BEP of Coded QAM using Single Error Correctable Integer Codes," IEICE Technical Report, pp. 103-108, Tokyo, Japan, March 2004.
  48. H. Kostadinov, H. Morita, N. L. Manev, “Derivation on Bit Error Probability of Coded QAM using Integer Codes”, IEICE Trans. Fundamentals, vol. E87-A, no. 12, 3397-3403, Dec. 2004.
  49. N. L. Manev, “GP and Strictly Balance Sequences”, Докладвано на XVIII Escola de Algebra, 19-24 July, 2004, Campinas (Sao Paulo), Бразилия
  50. N. L. Manev, Strictly Balanced and Generating Permutation Sequences, Comptes rendus de l'Academie bulgare des Sciences (Доклади на БАН), Tome 58 (2005), No 2, pp.123 –128.
  51. N. L. Manev, Linear recursions generating permutation and random number generators', Proceeding of ICTAMI'2005, 13-17. 09. 2005, Romania.
  52. N. L. Manev, F. A. Sallam, “Primes of shape 2pq+1, p,q primes”, MASSEE Int. Congress on Mathematics, May 31 – June 4, 2006, Cyprus.
  53. Y. Borissov, S. Nikova, N. L. Manev, “On primitive polynomials over GF(2) the duals of which are also primitive”, 27-th Symposium on Information Theory in the Benelux, June 8-9, Noordwijk, The Netherlands.
  54. H. Kostadinov, H. Morita, N. L, Manev, A. J. Han Vinck, “Coded modulation with single error correctable integer codes” 10th Int. Workshop on Algebraic and Combinatorial Coding Theory, Zvenigorod, Russia, Sept. 3-9, 2006.
  55. H. Kostadinov, N. L, Manev, H. Morita, “A software package for simulation of coded modulation”, The Annual National Seminar on Coding Theory, Blagoevgrad, Nov. 30 – Dec. 3, 2006.
  56. H. Kostadinov, N. L. Manev, H. Morita, “A software package for simulation of coded modulation”, Fifth International Workshop on Optimal Codes and Related Topics, 16-22 June, 2007, White Lagoon (Balchik), Bulgaria.
  57. N. L. Manev, M. H. .Lee, Y. Borissov, "Interleaver Design- a New Approach, Eight MSPT, August 7, Chonbuk University, Jeounju, South. Korea.
  58. M. H. .Lee, N. L. Manev, Xiao-Dong Zhang, "Jacket Transform Eigenvalue Decomposition", Applied Mathematics and Computation, Vol. 198/2, pp.858-864, May 2008, Elsevier.
  59. H. Kostadinov, N. L. Manev, H. Morita, “Double ±1-error correctable codes and their applications to modulation schemes”, Eleventh Int. Workshop on Algebraic and Combinatorial Coding Theory, June 16-22, 2008, Pamporovo, pp. 155-160.
  60. H. Kostadinov, N. Iijima, H. Morita, N. L. Manev, “On Some Simulation Results For BER Over Integer Coded Modulation Using Integer Codes”, Symposium on Information Theory and Its Applications (SITA2008), Japan.
  61. H. Kostadinov, N. L. Manev, N. Iijima, H. Morita, “Double error correctable integer code and its application to QAM”, Intern. Symposium on Information Theory and Its Applications (ISITA2008), Auckland, New Zenland, December 7-10, 2008, pp. 566-571.
  62. H. Kostadinov, N. L. Manev, H. Morita, On ±1-error correctable integer residue codes”, Fifth International Workshop on Optimal Codes and Related Topics, 16-22 June, 2009,Varna, Bulgaria, pp,117-121.
  63. Y.Borissov, N.Manev, “Some Comments on Bossert-Mahr-Heilig Scheme“, Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes”, NATO Science for Peace and Security Series, D: Information and Communication Security –vol. 23, IOS Press, 2009, pp. 244-249.
  64. N. L. Manev, "Simulation of digital communication systems on grid infrastructure", Proceeding of SEE-GRID-SCI USER FORUM 2009, Bogazici University, December 8-9, 2009, Istanbul, Turkey, pp. 113-116.
  65. N. L. Manev, "Sequences generating permutations", Applied Mathematics and Computation, Elsevier, Vol. 216 (2010), no. 3, pp.708-718.
  66. N. L. Manev, "Grid and simulation of digital communication systems", Serdica Journal of Computing, vol. 4 (2010), pp. 101-112.
  67. H. Kostadinov, H. Morita, Noboru Iijima, A. J. Han Vinck, N. L. Manev, “Soft Decoding of Integer Codes and Their Application to Coded Modulation”, IEICE Trans. Fundamentals, vol. E93-A, no. 7, 1363-1370, 2010.
  68. H. Kostadinov, H. Morita, N. L. Manev, “On (-1,+1) Error Correctable Integer Codes”, IEICE Trans. Fundamentals, vol. E93-A, no. 12, 2010.
  69. S. Boumova, H.Kostadinov, N.L.Manev, “Watermarking, Steganography, and Error-Control Codes”, American Institute of Physics Conference proceedings vol. 1404, 193-199.
  70. S. Ivanovska, A. Karaivanova, N. L. Manev, Numerical Integration Using Sequences Generating Permutations, Lecture Notes in Computer Sciences
  71. T.Gurov, S. Ivanovska, A. Karaivanova, N.L.Manev, “Monte Carlo Methods using a New Class of Congruential Generators”, L. Kocarev (Ed.): ICT Innovations 2011, AISC 150, pp. 257–267, Springer-Verlag Berlin Heidelberg 2012.
  72. E. Atanassov, D. Georgiev, N. L. Manev, "ECM Integer factorization on GPU Cluster", Proceeding of MIPRO 2012 - Jubilee 35th International Convention, DC-VIS - Distributed Computing and Visualization Systems, May 21-25, 2012, Opatija, Croatia.
  73. N. L. Manev, Algebraic Coding Theory, TEMPUS Lecture Notes: Discrete Mathematics and Applications, vol. 15, 1995
  74. Н. Л. Манев, Начален курс по теория на кодирането, Записки от лекции, И-т по математика и информатика при БАН, София, 1996.
  75. Н. Л. Манев, Лекции по теория на числата, София 2003, http/:www.manev.net/edu.
  76. Н. Л. Манев, Кодиране и криптография, Деметра, 2005.
  77. С.Бумова, Н.Манев, Пермутационни групи, http://sharoacademy.math.bas.bg/Algebra.html

Certificates for inventions

  1. Авт. св. BG № 41272: “Паралелно устройство за умножение в крайни полета”, приоритет 30.12.1985, рег.№ 72950.
  2. Авт. св. BG № 41441: “Последователно-паралелно устройство за умножение в крайни полета”, приоритет 30.12.1985, рег.№ 72952.
  3. Авт. Св. BG № ?????: “Устройство за коригиране на трикратни грешки”, приоритет 24.09.1986, рег.№76512
  4. Авт. св. BG № 45997: “Декодиращо устройство за коригиране на грешки”, приоритет 10.05.1988, рег.№ 84097.
  5. Авт. св. BG № 48089: “Изчислител на адресите на грешките”, приоритет 14.04.1989, рег.№ 88070.
  6. Авт. св. BG № 49259: “Устройство за коригиране на пакети от грешки”, приоритет 29.09.1989, рег.№ 89862.
  7. Авт. св. SU № 1383338: “Параллельное устройство для умножения в конечных полях”, приоритет 24.04.1986, заяв..№ 4058748, СССР.
  8. Авт. св. SU № 1399725: “Параллельно-последовательное устройство для умножения в конечных полях”, приоритет 24.04.1986, заяв..№ 4058749, СССР.
  9. Авт. св. SU № 1499334: “Параллельное устройство для умножения в поля Галуа GF(2n)”, приоритет 06.07.1987, заяв..№ 4277465, СССР.
  10. Авт. св. SU № 1603532: “Устройство для исправления искажений в системах передачи дискретной информации”, приоритет 24.03.1987, заяв..№ 4239045, СССР.