Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Davydov, Alexander Abramovich

Statistics Math-Net.Ru
Total publications: 10
Scientific articles: 10
Presentations: 3

Number of views:
This page:1896
Abstract pages:3194
Full texts:1292
References:208
Candidate of technical sciences (1973)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 7.10.1941
E-mail:
Keywords: covering codes, projective geometry, saturating sets, complete caps.
UDC: 621.391.15

Subject:

Coding theory, Combinatorics.

   
Main publications:
  1. A.A. Davydov, L.M. Tombak, “Quasi-perfect linear binary codes with distance 4 and complete caps in projective geometry”, Problems of Information Transmission, 25:4 (1989), 265–275  mathscinet  zmath
  2. A.A. Davydov, “Construction of linear covering codes”, Problems of Information Transmission, 26:4 (1990), 317–331  mathscinet  zmath
  3. E.M. Gabidulin, A.A. Davydov, L.M. Tombak, “Linear codes with covering radius 2 and other new covering codes”, IEEE Transactions on Information Theory, 37:1 (1991), 219–224  crossref  mathscinet  zmath
  4. A.A. Davydov, “Constructions and families of covering codes and saturated sets of points in projective geometry”, IEEE Transactions on Information Theory, 41 (1995), 2071–2080  crossref  mathscinet  zmath
  5. A.A. Davydov, “Constructions of nonlinear covering codes”, IEEE Transactions on Information Theory, 43 (1997), 1639–1647  crossref  mathscinet  zmath

https://www.mathnet.ru/eng/person46297
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/203817

Publications in Math-Net.Ru Citations
2018
1. D. Bartoli, A. A. Davydov, S. Marcugini, F. Pambianco, “On the smallest size of an almost complete subset of a conic in $\mathrm{PG}(2,q)$ and extendability of Reed–Solomon codes”, Probl. Peredachi Inf., 54:2 (2018),  3–19  mathnet  elib; Problems Inform. Transmission, 54:2 (2018), 101–115  isi  scopus
2014
2. D. Bartoli, A. A. Davydov, G. Faina, A. A. Kreshchuk, S. Marcugini, F. Pambianco, “Upper bounds on the smallest size of a complete arc in $PG(2,q)$ under a certain probabilistic conjecture”, Probl. Peredachi Inf., 50:4 (2014),  22–42  mathnet  mathscinet; Problems Inform. Transmission, 50:4 (2014), 320–339  isi  scopus 6
2011
3. A. A. Kreshchuk, A. A. Davydov, V. V. Zyablov, “Codes for MIMO transmission based on orthogonal sequences”, Probl. Peredachi Inf., 47:4 (2011),  3–26  mathnet  mathscinet; Problems Inform. Transmission, 47:4 (2011), 305–326  isi  scopus 1
2010
4. A. A. Davydov, V. V. Zyablov, R. E. Kalimullin, “Special sequences as subcodes of Reed–Solomon codes”, Probl. Peredachi Inf., 46:4 (2010),  56–82  mathnet  mathscinet; Problems Inform. Transmission, 46:4 (2010), 321–345  isi  scopus 2
1990
5. A. A. Davydov, “Construction of Linear Covering Codes”, Probl. Peredachi Inf., 26:4 (1990),  38–55  mathnet  mathscinet  zmath; Problems Inform. Transmission, 26:4 (1990), 317–331
1989
6. A. A. Davydov, A. Yu. Drozhzhina-Lobinskaya, “Correction of error bytes of length 4 and double independent errors by the Bose — Chaudhuri — Hocquenjhem code in semi-conducting memory units”, Avtomat. i Telemekh., 1989, no. 11,  135–146  mathnet  mathscinet  zmath; Autom. Remote Control, 50:11 (1989), 1570–1579
7. A. A. Davydov, L. M. Tombak, “Quasiperfect Linear Binary Codes with Distance 4 and Complete Caps in Projective Geometry”, Probl. Peredachi Inf., 25:4 (1989),  11–23  mathnet  mathscinet  zmath; Problems Inform. Transmission, 25:4 (1989), 265–275 1
1988
8. A. A. Davydov, L. M. Tombak, “On the Number of Minimum-Weight Words in Block Codes”, Probl. Peredachi Inf., 24:1 (1988),  11–24  mathnet  mathscinet  zmath; Problems Inform. Transmission, 24:1 (1988), 7–18
1987
9. I. M. Boyarinov, A. A. Davydov, B. M. Shabanov, “Error correction in main memory of a fast computer”, Avtomat. i Telemekh., 1987, no. 7,  152–165  mathnet
1972
10. G. M. Tenengol'ts, A. A. Davydov, G. L. Tauglikh, “A Burst-Error-Correcting Code and Its Application for Information Exchange between Computers”, Probl. Peredachi Inf., 8:3 (1972),  27–37  mathnet  mathscinet  zmath; Problems Inform. Transmission, 8:3 (1972), 199–206

Presentations in Math-Net.Ru
1. О наименьшем размере почти полного подмножества коники в плоскости PG(2,q) и расширяемости кодов Рида-Соломона
A. A. Davydov
Seminar on Coding Theory
October 25, 2016 19:05
2. Верхние границы наименьшего размера полной шапки в проективном пространстве PG(N,q) при некотором вероятностном предположении
A. A. Davydov
Seminar on Coding Theory
March 22, 2016 19:00
3. Верхние границы наименьшего размера полных дуг в проективной плоскости PG(2,q) при некоторых вероятностных предположениях
A. A. Davydov
Seminar on Coding Theory
January 14, 2014 19:00

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024