| 2009 |
|---|
| 19 | EE | 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 Cryptography 50(3): 359-372 (2009) |
| 2006 |
|---|
| 18 | EE | 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): 647-663 (2006) |
| 2005 |
|---|
| 17 | EE | Alexander A. Davydov,
Giorgio Faina,
Fernanda Pambianco:
Constructions of Small Complete Caps in Binary Projective Spaces.
Des. Codes Cryptography 37(1): 61-80 (2005) |
| 16 | EE | Alexander 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 |
|---|
| 15 | | Alexander 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 |
|---|
| 14 | EE | Alexander A. Davydov,
Stefano Marcugini,
Fernanda Pambianco:
On saturating sets in projective spaces.
J. Comb. Theory, Ser. A 103(1): 1-15 (2003) |
| 2001 |
|---|
| 13 | EE | Alexander A. Davydov,
Hubertus Th. Jongen:
Normal Forms in One-Parametric Optimization.
Annals OR 101(1-4): 255-265 (2001) |
| 12 | | Alexander A. Davydov:
New Constructions of Covering Codes.
Des. Codes Cryptography 22(3): 305-316 (2001) |
| 11 | | Alexander 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 |
|---|
| 10 | EE | Alexander A. Davydov,
Patric R. J. Östergård:
On Saturating Sets in Small Projective Geometries.
Eur. J. Comb. 21(5): 563-570 (2000) |
| 1999 |
|---|
| 9 | | Alexander 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) |
| 8 | | Alexander A. Davydov:
Constructions and families of nonbinary linear codes with covering radius 2.
IEEE Transactions on Information Theory 45(5): 1679-1686 (1999) |
| 1997 |
|---|
| 7 | | Alexander A. Davydov:
Constructions of nonlinear covering codes.
IEEE Transactions on Information Theory 43(5): 1639-1647 (1997) |
| 1995 |
|---|
| 6 | | Alexander 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 |
|---|
| 5 | | Alexander A. Davydov,
A. Yu Drozhzhina-Labvinskaya:
Constructions, families, and tables of binary linear covering codes.
IEEE Transactions on Information Theory 40(4): 1270- (1994) |
| 1991 |
|---|
| 4 | | Alexander A. Davydov:
Constructions of Codes with Covering Radius 2.
Algebraic Coding 1991: 23-31 |
| 3 | | Ernst 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- (1991) |
| 2 | | Alexander 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- (1991) |
| 1971 |
|---|
| 1 | | 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 |
