Alexander A. Davydov

According to our database1, Alexander A. Davydov authored at least 51 papers between 1971 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On planes through points off the twisted cubic in PG(3, <i>q</i>) and multiple covering codes.
Finite Fields Their Appl., 2020

On cosets weight distributions of the doubly-extended Reed-Solomon codes of codimension 4.
CoRR, 2020

On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3.
CoRR, 2020

Bounds for Complete Arcs in $\mathrm {PG}(3, q)$ and Covering Codes of Radius 3, Codimension 4, Under a Certain Probabilistic Conjecture.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

2019
New covering codes of radius R, codimension tR and $$tR+\frac{R}{2}$$, and saturating sets in projective spaces.
Des. Codes Cryptogr., 2019

New bounds for linear codes of covering radii 2 and 3.
Cryptogr. Commun., 2019

2018
On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, <i>q</i>) and Extendability of Reed-Solomon Codes.
Probl. Inf. Transm., 2018

2017
Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q).
Electron. Notes Discret. Math., 2017

Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3.
Electron. Notes Discret. Math., 2017

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5.
CoRR, 2017

Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N, q)$, $N\ge3$, under a certain probabilistic conjecture.
CoRR, 2017

Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension.
CoRR, 2017

Weight spectrum of quasi-perfect binary codes with distance 4.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

New Bounds for Linear Codes of Covering Radius 2.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
On constructions and parameters of symmetric configurations v<sub>k</sub>.
Des. Codes Cryptogr., 2016

Further results on multiple coverings of the farthest-off points.
Adv. Math. Commun., 2016

2015
Multiple coverings of the farthest-off points with small density from projective geometry.
Adv. Math. Commun., 2015

2014
Upper bounds on the smallest size of a complete arc in <i>PG</i>(2, <i>q</i>) under a certain probabilistic conjecture.
Probl. Inf. Transm., 2014

2013
Some Combinatorial Aspects of Constructing Bipartite-Graph Codes.
Graphs Comb., 2013

A note on multiple coverings of the farthest-off points.
Electron. Notes Discret. Math., 2013

A new algorithm and a new type of estimate for the smallest size of complete arcs in <i>P</i><i>G</i>(2, <i>q</i>)PG(2, q).
Electron. Notes Discret. Math., 2013

Tables of parameters of symmetric configurations $v_{k}$.
CoRR, 2013

A 3-cycle construction of complete arcs sharing (q+3)/2 points with a conic.
Adv. Math. Commun., 2013

Numerical Simulation of the Low Compressible Viscous Gas Flows on GPU-based Hybrid Supercomputers.
Proceedings of the Parallel Computing: Accelerating Computational Science and Engineering (CSE), 2013

2012
On sizes of complete arcs in PG(2, q).
Discret. Math., 2012

2011
Codes for MIMO transmission based on orthogonal sequences.
Probl. Inf. Transm., 2011

Upper bounds on the smallest size of a complete arc in the plane PG(2,q)
CoRR, 2011

Linear nonbinary covering codes and saturating sets in projective spaces.
Adv. Math. Commun., 2011

The minimum order of complete caps in PG(4, 4).
Adv. Math. Commun., 2011

2010
Special sequences as subcodes of reed-solomon codes.
Probl. Inf. Transm., 2010

Linear codes with covering radius 3.
Des. Codes Cryptogr., 2010

On sizes of complete arcs in PG(2,q)
CoRR, 2010

2009
Complete ( <i>q</i> <sup>2</sup> + <i>q</i> + 8)/2-caps in the spaces <i>PG</i> (3, <i>q</i> ), <i>q</i> = 2 (mod 3) an odd prime, and a complete 20-cap in <i>PG</i> (3, 5).
Des. Codes Cryptogr., 2009

2006
Minimal 1-saturating sets and complete caps in binary projective spaces.
J. Comb. Theory, Ser. A, 2006

2005
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces.
IEEE Trans. Inf. Theory, 2005

Constructions of Small Complete Caps in Binary Projective Spaces.
Des. Codes Cryptogr., 2005

2004
Linear codes with covering radius 2, 3 and saturating sets in projective geometry.
IEEE Trans. Inf. Theory, 2004

2003
On saturating sets in projective spaces.
J. Comb. Theory, Ser. A, 2003

2001
Linear codes with covering radius R = 2, 3 and codimension tR.
IEEE Trans. Inf. Theory, 2001

New Constructions of Covering Codes.
Des. Codes Cryptogr., 2001

Normal Forms in One-Parametric Optimization.
Ann. Oper. Res., 2001

2000
On Saturating Sets in Small Projective Geometries.
Eur. J. Comb., 2000

1999
Constructions and families of nonbinary linear codes with covering radius 2.
IEEE Trans. Inf. Theory, 1999

New Linear Codes with Covering Radius 2 and Odd Basis.
Des. Codes Cryptogr., 1999

1997
Constructions of nonlinear covering codes.
IEEE Trans. Inf. Theory, 1997

1995
Constructions and families of covering codes and saturated sets of points in projective geometry.
IEEE Trans. Inf. Theory, 1995

1994
Constructions, families, and tables of binary linear covering codes.
IEEE Trans. Inf. Theory, 1994

1991
Linear codes with covering radius 2 and other new covering codes.
IEEE Trans. Inf. Theory, 1991

An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory.
IEEE Trans. Inf. Theory, 1991

Constructions of Codes with Covering Radius 2.
Proceedings of the Algebraic Coding, 1991

1971
On a Class of Codes Correcting Errors in Information Exchanged Between Computers.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971


  Loading...