Alexander A. Davydov

Des. Codes Cryptogr., September, 2024

2023

New bounds for covering codes of radius 3 and codimension 3t+1.

[BibT_eX]

[DOI]

CoRR, 2023

On the weight distribution of the cosets of MDS codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

2021

On Cosets Weight Distribution of Doubly-Extended Reed-Solomon Codes of Codimension 4.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Twisted cubic and point-line incidence matrix in $\mathrm {PG}(3, q)$.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2021

Upper bounds on the length function for covering codes.

[BibT_eX]

[DOI]

CoRR, 2021

2020

On planes through points off the twisted cubic in PG(3, q) and multiple covering codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Bounds for Complete Arcs in $\mathrm {PG}(3, q)$ and Covering Codes of Radius 3, Codimension 4, Under a Certain Probabilistic Conjecture.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

New bounds for linear codes of covering radii 2 and 3.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

New bounds for linear codes of covering radius 3 and 2-saturating sets in projective spaces.

[BibT_eX]

[DOI]

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

2018

On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2018

2017

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Weight spectrum of quasi-perfect binary codes with distance 4.

[BibT_eX]

[DOI]

Valentin B. Afanassiev

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

New Bounds for Linear Codes of Covering Radius 2.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016

On constructions and parameters of symmetric configurations vk.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

Further results on multiple coverings of the farthest-off points.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2016

2015

Multiple coverings of the farthest-off points with small density from projective geometry.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

2014

Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture.

[BibT_eX]

[DOI]

Daniele Bartoli

Aleksei Andreevich Kreshchuk

Giorgio Faina

Probl. Inf. Transm., 2014

2013

Some Combinatorial Aspects of Constructing Bipartite-Graph Codes.

[BibT_eX]

[DOI]

Graphs Comb., 2013

A note on multiple coverings of the farthest-off points.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

A new algorithm and a new type of estimate for the smallest size of complete arcs in PG(2, q)PG(2, q).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Tables of parameters of symmetric configurations $v_{k}$.

[BibT_eX]

[DOI]

CoRR, 2013

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

[BibT_eX]

[DOI]

Adv. Math. Commun., 2013

Numerical simulation of the continuous media problems on hybrid computer systems.

[BibT_eX]

[DOI]

Boris N. Chetverushkin

Eugene V. Shilnikov

Adv. Eng. Softw., 2013

Numerical Simulation of the Low Compressible Viscous Gas Flows on GPU-based Hybrid Supercomputers.

[BibT_eX]

[DOI]

Evgeny V. Shilnikov

Proceedings of the Parallel Computing: Accelerating Computational Science and Engineering (CSE), 2013

2012

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

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

Codes for MIMO transmission based on orthogonal sequences.

[BibT_eX]

[DOI]

Alexey Kreshchuk

Victor V. Zyablov

Probl. Inf. Transm., 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Linear nonbinary covering codes and saturating sets in projective spaces.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

The minimum order of complete caps in PG(4, 4).

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

2010

Special sequences as subcodes of reed-solomon codes.

[BibT_eX]

[DOI]

Victor V. Zyablov

Rustam E. Kalimullin

Probl. Inf. Transm., 2010

Linear codes with covering radius 3.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

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

[BibT_eX]

[DOI]

CoRR, 2010

2009

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).

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

2006

Minimal 1-saturating sets and complete caps in binary projective spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

2005

Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Constructions of Small Complete Caps in Binary Projective Spaces.

[BibT_eX]

[DOI]

Giorgio Faina

Des. Codes Cryptogr., 2005

2004

Linear codes with covering radius 2, 3 and saturating sets in projective geometry.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

2003

On saturating sets in projective spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

2001

Linear codes with covering radius R = 2, 3 and codimension tR.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

New Constructions of Covering Codes.

[BibT_eX]

Des. Codes Cryptogr., 2001

Normal Forms in One-Parametric Optimization.

[BibT_eX]

[DOI]

Hubertus Th. Jongen

Ann. Oper. Res., 2001

2000

On Saturating Sets in Small Projective Geometries.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

1999

Constructions and families of nonbinary linear codes with covering radius 2.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

New Linear Codes with Covering Radius 2 and Odd Basis.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1999

1997

Constructions of nonlinear covering codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

1995

Constructions and families of covering codes and saturated sets of points in projective geometry.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1994

Constructions, families, and tables of binary linear covering codes.

[BibT_eX]

[DOI]

A. Yu Drozhzhina-Labvinskaya

IEEE Trans. Inf. Theory, 1994

1991

Linear codes with covering radius 2 and other new covering codes.

[BibT_eX]

[DOI]

Ernst M. Gabidulin

Leonid M. Tombak

IEEE Trans. Inf. Theory, 1991

An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory.

[BibT_eX]

[DOI]

Leonid M. Tombak

IEEE Trans. Inf. Theory, 1991

Constructions of Codes with Covering Radius 2.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1991

1971

On a Class of Codes Correcting Errors in Information Exchanged Between Computers.

[BibT_eX]