dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Alexander A. Davydov Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco: On sizes of complete arcs in PG(2, q). Discrete Mathematics 312(3): 680-698 (2012)
2011
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniele 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
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco: On sizes of complete arcs in PG(2,q) CoRR abs/1011.3347: (2010)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Patric R. J. Östergård: Linear codes with covering radius 3. Des. Codes Cryptography 54(3): 253-271 (2010)
2009
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco: Some combinatorial aspects of constructing bipartite-graph codes CoRR abs/0909.5669: (2009)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander 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 Cryptography 50(3): 359-372 (2009)
2006
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Stefano Marcugini, Fernanda Pambianco: Minimal 1-saturating sets and complete caps in binary projective spaces. J. Comb. Theory, Ser. A 113(4): 647-663 (2006)
2005
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Giorgio Faina, Fernanda Pambianco: Constructions of Small Complete Caps in Binary Projective Spaces. Des. Codes Cryptography 37(1): 61-80 (2005)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco: Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces. IEEE Transactions on Information Theory 51(12): 4378-4387 (2005)
2004
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Stefano Marcugini, Fernanda Pambianco: Linear codes with covering radius 2, 3 and saturating sets in projective geometry. IEEE Transactions on Information Theory 20(3): 537-541 (2004)
2003
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Stefano Marcugini, Fernanda Pambianco: On saturating sets in projective spaces. J. Comb. Theory, Ser. A 103(1): 1-15 (2003)
2001
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Hubertus Th. Jongen: Normal Forms in One-Parametric Optimization. Annals OR 101(1-4): 255-265 (2001)
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov: New Constructions of Covering Codes. Des. Codes Cryptography 22(3): 305-316 (2001)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Patric R. J. Östergård: Linear codes with covering radius R = 2, 3 and codimension tR. IEEE Transactions on Information Theory 47(1): 416-421 (2001)
2000
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Patric R. J. Östergård: On Saturating Sets in Small Projective Geometries. Eur. J. Comb. 21(5): 563-570 (2000)
1999
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Patric R. J. Östergård: New Linear Codes with Covering Radius 2 and Odd Basis. Des. Codes Cryptography 16(1): 29-39 (1999)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov: Constructions and families of nonbinary linear codes with covering radius 2. IEEE Transactions on Information Theory 45(5): 1679-1686 (1999)
1997
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov: Constructions of nonlinear covering codes. IEEE Transactions on Information Theory 43(5): 1639-1647 (1997)
1995
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov: Constructions and families of covering codes and saturated sets of points in projective geometry. IEEE Transactions on Information Theory 41(6): 2071-2080 (1995)
1994
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, A. Yu Drozhzhina-Labvinskaya: Constructions, families, and tables of binary linear covering codes. IEEE Transactions on Information Theory 40(4): 1270-1279 (1994)
1991
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov: Constructions of Codes with Covering Radius 2. Algebraic Coding 1991: 23-31
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErnst M. Gabidulin, Alexander A. Davydov, Leonid M. Tombak: Linear codes with covering radius 2 and other new covering codes. IEEE Transactions on Information Theory 37(1): 219-224 (1991)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Davydov, Leonid M. Tombak: An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory. IEEE Transactions on Information Theory 37(3): 897-902 (1991)
1971
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander 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

1Daniele Bartoli [23] [24]
2A. Yu Drozhzhina-Labvinskaya [5]
3Giorgio Faina [16] [17] [22] [23] [24]
4Ernst M. Gabidulin [3]
5Massimo Giulietti [20]
6Hubertus Th. Jongen [13]
7Stefano Marcugini [14] [15] [16] [18] [19] [20] [22] [23] [24]
8Patric R. J. Östergård [9] [10] [11] [21]
9Fernanda Pambianco [14] [15] [16] [17] [18] [19] [20] [22] [23] [24]
10G. M. Tenengol'ts [1]
11Leonid M. Tombak [2] [3]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page