Alexander A. Davydov

Publication Activity (10 Years)

Years Active: 1971-2024
Publications (10 Years): 26

Top Topics

Projective Space

Top Venues

Des. Codes Cryptogr.

Adv. Math. Commun.

Electron. Notes Discret. Math.

Publications

Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Further results on covering codes with radius R and codimension tR+1. Des. Codes Cryptogr. 92 (9) (2024)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $. Adv. Math. Commun. 17 (1) (2023)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
New bounds for covering codes of radius 3 and codimension 3t+1. CoRR (2023)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
On the weight distribution of the cosets of MDS codes. Adv. Math. Commun. 17 (5) (2023)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
On the weight distribution of the cosets of MDS codes. CoRR (2021)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Upper bounds on the length function for covering codes. CoRR (2021)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
On Cosets Weight Distribution of Doubly-Extended Reed-Solomon Codes of Codimension 4. IEEE Trans. Inf. Theory 67 (8) (2021)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Twisted cubic and point-line incidence matrix in $\mathrm {PG}(3, q)$. Des. Codes Cryptogr. 89 (10) (2021)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Bounds for Complete Arcs in $\mathrm {PG}(3, q)$ and Covering Codes of Radius 3, Codimension 4, Under a Certain Probabilistic Conjecture. ICCSA (1) (2020)
Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
) and multiple covering codes. Finite Fields Their Appl. 67 (2020)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
On cosets weight distributions of the doubly-extended Reed-Solomon codes of codimension 4. CoRR (2020)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3. CoRR (2020)
Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
New bounds for linear codes of covering radii 2 and 3. Cryptogr. Commun. 11 (5) (2019)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
New bounds for linear codes of covering radius 3 and 2-saturating sets in projective spaces. REDUNDANCY (2019)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
New covering codes of radius R, codimension tR and $$tR+\frac{R}{2}$$, and saturating sets in projective spaces. Des. Codes Cryptogr. 87 (12) (2019)
Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
) and Extendability of Reed-Solomon Codes. Probl. Inf. Transm. 54 (2) (2018)
Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N, q)$, $N\ge3$, under a certain probabilistic conjecture. CoRR (2017)
Valentin B. Afanassiev, Alexander A. Davydov
Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4. CoRR (2017)
Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension. CoRR (2017)
Valentin B. Afanassiev, Alexander A. Davydov
Weight spectrum of quasi-perfect binary codes with distance 4. ISIT (2017)
Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5. CoRR (2017)
Daniele Bartoli, Alexander A. Davydov, Alexey Kreshchuk, Stefano Marcugini, Fernanda Pambianco
Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q). Electron. Notes Discret. Math. 57 (2017)
Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3. Electron. Notes Discret. Math. 57 (2017)
Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
New Bounds for Linear Codes of Covering Radius 2. ICMCTA (2017)
Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
Further results on multiple coverings of the farthest-off points. Adv. Math. Commun. 10 (3) (2016)
Alexander A. Davydov, Giorgio Faina, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
. Des. Codes Cryptogr. 80 (1) (2016)
Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
Multiple coverings of the farthest-off points with small density from projective geometry. Adv. Math. Commun. 9 (1) (2015)
Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Aleksei Andreevich Kreshchuk, Stefano Marcugini, Fernanda Pambianco
) under a certain probabilistic conjecture. Probl. Inf. Transm. 50 (4) (2014)
Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
A 3-cycle construction of complete arcs sharing (q+3)/2 points with a conic. Adv. Math. Commun. 7 (3) (2013)
Daniele Bartoli, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco, Alexander A. Davydov
)PG(2, q). Electron. Notes Discret. Math. 40 (2013)
Alexander A. Davydov, Evgeny V. Shilnikov
Numerical Simulation of the Low Compressible Viscous Gas Flows on GPU-based Hybrid Supercomputers. PARCO (2013)
Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
Some Combinatorial Aspects of Constructing Bipartite-Graph Codes. Graphs Comb. 29 (2) (2013)
Boris N. Chetverushkin, Eugene V. Shilnikov, Alexander A. Davydov
Numerical simulation of the continuous media problems on hybrid computer systems. Adv. Eng. Softw. 60 (2013)
Fernanda Pambianco, Alexander A. Davydov, Daniele Bartoli, Massimo Giulietti, Stefano Marcugini
A note on multiple coverings of the farthest-off points. Electron. Notes Discret. Math. 40 (2013)
Alexander A. Davydov, Giorgio Faina, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
Tables of parameters of symmetric configurations $v_{k}$. CoRR (2013)
Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
On sizes of complete arcs in PG(2, q). Discret. Math. 312 (3) (2012)
Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
Upper bounds on the smallest size of a complete arc in the plane PG(2,q) CoRR (2011)
Alexey Kreshchuk, Alexander A. Davydov, Victor V. Zyablov
Codes for MIMO transmission based on orthogonal sequences. Probl. Inf. Transm. 47 (4) (2011)
Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
The minimum order of complete caps in PG(4, 4). Adv. Math. Commun. 5 (1) (2011)
Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
Linear nonbinary covering codes and saturating sets in projective spaces. Adv. Math. Commun. 5 (1) (2011)
Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
On sizes of complete arcs in PG(2,q) CoRR (2010)
Alexander A. Davydov, Patric R. J. Östergård
Linear codes with covering radius 3. Des. Codes Cryptogr. 54 (3) (2010)
Alexander A. Davydov, Victor V. Zyablov, Rustam E. Kalimullin
Special sequences as subcodes of reed-solomon codes. Probl. Inf. Transm. 46 (4) (2010)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
(3, 5). Des. Codes Cryptogr. 50 (3) (2009)
Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
Some combinatorial aspects of constructing bipartite-graph codes CoRR (2009)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Minimal 1-saturating sets and complete caps in binary projective spaces. J. Comb. Theory, Ser. A 113 (4) (2006)
Alexander A. Davydov, Giorgio Faina, Fernanda Pambianco
Constructions of Small Complete Caps in Binary Projective Spaces. Des. Codes Cryptogr. 37 (1) (2005)
Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces. IEEE Trans. Inf. Theory 51 (12) (2005)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Linear codes with covering radius 2, 3 and saturating sets in projective geometry. IEEE Trans. Inf. Theory 50 (3) (2004)
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
On saturating sets in projective spaces. J. Comb. Theory, Ser. A 103 (1) (2003)
Alexander A. Davydov
New Constructions of Covering Codes. Des. Codes Cryptogr. 22 (3) (2001)
Alexander A. Davydov, Hubertus Th. Jongen
Normal Forms in One-Parametric Optimization. Ann. Oper. Res. 101 (1-4) (2001)
Alexander A. Davydov, Patric R. J. Östergård
Linear codes with covering radius R = 2, 3 and codimension tR. IEEE Trans. Inf. Theory 47 (1) (2001)
Alexander A. Davydov, Patric R. J. Östergård
On Saturating Sets in Small Projective Geometries. Eur. J. Comb. 21 (5) (2000)
Alexander A. Davydov, Patric R. J. Östergård
New Linear Codes with Covering Radius 2 and Odd Basis. Des. Codes Cryptogr. 16 (1) (1999)
Alexander A. Davydov
Constructions and families of nonbinary linear codes with covering radius 2. IEEE Trans. Inf. Theory 45 (5) (1999)
Alexander A. Davydov
Constructions of nonlinear covering codes. IEEE Trans. Inf. Theory 43 (5) (1997)
Alexander A. Davydov
Constructions and families of covering codes and saturated sets of points in projective geometry. IEEE Trans. Inf. Theory 41 (6) (1995)
Alexander A. Davydov, A. Yu Drozhzhina-Labvinskaya
Constructions, families, and tables of binary linear covering codes. IEEE Trans. Inf. Theory 40 (4) (1994)
Alexander A. Davydov, Leonid M. Tombak
An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory. IEEE Trans. Inf. Theory 37 (3) (1991)
Alexander A. Davydov
Constructions of Codes with Covering Radius 2. Algebraic Coding (1991)
Ernst M. Gabidulin, Alexander A. Davydov, Leonid M. Tombak
Linear codes with covering radius 2 and other new covering codes. IEEE Trans. Inf. Theory 37 (1) (1991)
Alexander A. Davydov, G. M. Tenengol'ts
On a Class of Codes Correcting Errors in Information Exchanged Between Computers. IFIP Congress (1) (1971)