default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander A. Davydov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]Alexander A. Davydov
, Stefano Marcugini, Fernanda Pambianco:
Further results on covering codes with radius R and codimension tR+1. Des. Codes Cryptogr. 92(9): 2527-2548 (2024)- 2023
- [j42]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): 98-118 (2023) - [j41]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On the weight distribution of the cosets of MDS codes. Adv. Math. Commun. 17(5): 1115-1138 (2023) - [i13]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
New bounds for covering codes of radius 3 and codimension 3t+1. CoRR abs/2305.11955 (2023) - 2021
- [j40]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
Twisted cubic and point-line incidence matrix in $\mathrm {PG}(3, q)$. Des. Codes Cryptogr. 89(10): 2211-2233 (2021) - [j39]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): 5088-5096 (2021) - [i12]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On the weight distribution of the cosets of MDS codes. CoRR abs/2101.12722 (2021) - [i11]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the length function for covering codes. CoRR abs/2108.13609 (2021) - 2020
- [j38]Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On planes through points off the twisted cubic in PG(3, q) and multiple covering codes. Finite Fields Their Appl. 67: 101710 (2020) - [c7]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: 107-122 - [i10]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3. CoRR abs/2007.02405 (2020) - [i9]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On cosets weight distributions of the doubly-extended Reed-Solomon codes of codimension 4. CoRR abs/2007.08798 (2020)
2010 – 2019
- 2019
- [j37]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): 903-920 (2019) - [j36]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): 2771-2792 (2019) - [c6]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: 52-57 - 2018
- [j35]Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed-Solomon Codes. Probl. Inf. Transm. 54(2): 101-115 (2018) - 2017
- [j34]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: 15-20 (2017) - [j33]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: 21-26 (2017) - [c5]Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
New Bounds for Linear Codes of Covering Radius 2. ICMCTA 2017: 1-10 - [c4]Valentin B. Afanassiev, Alexander A. Davydov:
Weight spectrum of quasi-perfect binary codes with distance 4. ISIT 2017: 2193-2197 - [i8]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 abs/1702.07939 (2017) - [i7]Valentin B. Afanassiev, Alexander A. Davydov:
Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4. CoRR abs/1703.04106 (2017) - [i6]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 abs/1706.01941 (2017) - [i5]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 abs/1712.07078 (2017) - 2016
- [j32]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): 613-632 (2016) - [j31]Alexander A. Davydov, Giorgio Faina, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
On constructions and parameters of symmetric configurations vk. Des. Codes Cryptogr. 80(1): 125-147 (2016) - 2015
- [j30]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): 63-85 (2015) - 2014
- [j29]Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Aleksei Andreevich Kreshchuk, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture. Probl. Inf. Transm. 50(4): 320-339 (2014) - 2013
- [j28]Boris N. Chetverushkin, Eugene V. Shilnikov, Alexander A. Davydov:
Numerical simulation of the continuous media problems on hybrid computer systems. Adv. Eng. Softw. 60: 42-47 (2013) - [j27]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): 319-334 (2013) - [j26]Daniele Bartoli, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco, Alexander A. Davydov:
A new algorithm and a new type of estimate for the smallest size of complete arcs in PG(2, q)PG(2, q). Electron. Notes Discret. Math. 40: 27-31 (2013) - [j25]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: 289-293 (2013) - [j24]Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Some Combinatorial Aspects of Constructing Bipartite-Graph Codes. Graphs Comb. 29(2): 187-212 (2013) - [c3]Alexander A. Davydov, Evgeny V. Shilnikov:
Numerical Simulation of the Low Compressible Viscous Gas Flows on GPU-based Hybrid Supercomputers. PARCO 2013: 315-323 - [i4]Alexander A. Davydov, Giorgio Faina, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Tables of parameters of symmetric configurations $v_{k}$. CoRR abs/1312.3837 (2013) - 2012
- [j23]Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
On sizes of complete arcs in PG(2, q). Discret. Math. 312(3): 680-698 (2012) - 2011
- [j22]Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
The minimum order of complete caps in PG(4, 4). Adv. Math. Commun. 5(1): 37-40 (2011) - [j21]Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Linear nonbinary covering codes and saturating sets in projective spaces. Adv. Math. Commun. 5(1): 119-147 (2011) - [j20]Alexey Kreshchuk, Alexander A. Davydov, Victor V. Zyablov:
Codes for MIMO transmission based on orthogonal sequences. Probl. Inf. Transm. 47(4): 305-326 (2011) - [i3]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 abs/1111.3403 (2011) - 2010
- [j19]Alexander A. Davydov, Patric R. J. Östergård:
Linear codes with covering radius 3. Des. Codes Cryptogr. 54(3): 253-271 (2010) - [j18]Alexander A. Davydov, Victor V. Zyablov, Rustam E. Kalimullin:
Special sequences as subcodes of reed-solomon codes. Probl. Inf. Transm. 46(4): 321-345 (2010) - [i2]Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
On sizes of complete arcs in PG(2,q). CoRR abs/1011.3347 (2010)
2000 – 2009
- 2009
- [j17]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
Complete ( q 2 + q + 8)/2-caps in the spaces PG (3, q ), q = 2 (mod 3) an odd prime, and a complete 20-cap in PG (3, 5). Des. Codes Cryptogr. 50(3): 359-372 (2009) - [i1]Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Some combinatorial aspects of constructing bipartite-graph codes. CoRR abs/0909.5669 (2009) - 2006
- [j16]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
Minimal 1-saturating sets and complete caps in binary projective spaces. J. Comb. Theory A 113(4): 647-663 (2006) - 2005
- [j15]Alexander A. Davydov, Giorgio Faina, Fernanda Pambianco:
Constructions of Small Complete Caps in Binary Projective Spaces. Des. Codes Cryptogr. 37(1): 61-80 (2005) - [j14]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): 4378-4387 (2005) - 2004
- [j13]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): 537-541 (2004) - 2003
- [j12]Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On saturating sets in projective spaces. J. Comb. Theory A 103(1): 1-15 (2003) - 2001
- [j11]Alexander A. Davydov, Hubertus Th. Jongen:
Normal Forms in One-Parametric Optimization. Ann. Oper. Res. 101(1-4): 255-265 (2001) - [j10]Alexander A. Davydov:
New Constructions of Covering Codes. Des. Codes Cryptogr. 22(3): 305-316 (2001) - [j9]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): 416-421 (2001) - 2000
- [j8]Alexander A. Davydov, Patric R. J. Östergård:
On Saturating Sets in Small Projective Geometries. Eur. J. Comb. 21(5): 563-570 (2000)
1990 – 1999
- 1999
- [j7]Alexander A. Davydov, Patric R. J. Östergård:
New Linear Codes with Covering Radius 2 and Odd Basis. Des. Codes Cryptogr. 16(1): 29-39 (1999) - [j6]Alexander A. Davydov:
Constructions and families of nonbinary linear codes with covering radius 2. IEEE Trans. Inf. Theory 45(5): 1679-1686 (1999) - 1997
- [j5]Alexander A. Davydov:
Constructions of nonlinear covering codes. IEEE Trans. Inf. Theory 43(5): 1639-1647 (1997) - 1995
- [j4]Alexander A. Davydov:
Constructions and families of covering codes and saturated sets of points in projective geometry. IEEE Trans. Inf. Theory 41(6): 2071-2080 (1995) - 1994
- [j3]Alexander A. Davydov, A. Yu Drozhzhina-Labvinskaya:
Constructions, families, and tables of binary linear covering codes. IEEE Trans. Inf. Theory 40(4): 1270-1279 (1994) - 1991
- [j2]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): 219-224 (1991) - [j1]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): 897-902 (1991) - [c2]Alexander A. Davydov:
Constructions of Codes with Covering Radius 2. Algebraic Coding 1991: 23-31
1970 – 1979
- 1971
- [c1]Alexander A. Davydov, G. M. Tenengol'ts:
On a Class of Codes Correcting Errors in Information Exchanged Between Computers. IFIP Congress (1) 1971: 697-703
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
