Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5, electronic publication, arXiv:1712.07078v6 [cs.IT], 51 pages, 14 figures, 5 tables, 35 references, June 2020
Go to publication Download (1.2 MB)

On planes through points off the twisted cubic in PG(3,q) and multiple covering codes, electronic publication, arXiv:1909.00207v2 [math.CO], 27 pages, 2 tables, 31 references, March 2020
Go to publication Download (296.4 KB)

New bounds for linear codes of covering radius 3 and 2-saturating sets in projective spaces. In: Proceedings of 2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), ISBN 978-1-7281-1944-1, Moscow, Russia, 21--25 October 2019, pp. 47--52, Date Added to IEEE Xplore: 20 February 2020, DOI:10.1109/REDUNDANCY48165.2019.9003348
Go to publication

New upper bounds on the smallest size of a complete cap in the spaces PG(3,q) and PG(4,q), Ars Combinatoria, vol. 147, Oct. 2019, pp. 87-96
Go to publication

On planes through points off the twisted cubic in PG(3,q) and multiple covering codes, electronic publication, arXiv:1909.00207v1 [math.CO], 25 pages, 2 tables, 22 references, August 2019
Go to publication Download (264.7 KB)

New covering codes of radius R, codimension tR and tR+R/2, and saturating sets in projective spaces, Designs, Codes and Cryptography, 2019, Vol. 87, No. 12, pp. 2771–2792
Go to publication

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5, electronic publication, arXiv:1712.07078v5 [cs.IT], 49 pages, 14 figures, 5 tables, 35 references, Dec.2019
Go to publication Download (1.2 MB)

New covering codes of radius R, codimension tR and tR+R/2, and saturating sets in projective spaces, electronic publication, arXiv:1808.09301v2 [math.CO], 25 pages, 1 table, 33 references, March 2019
Go to publication Download (301.7 KB)

New bounds for linear codes of covering radii 2 and 3, Cryptography and Communications, Special Issue on Coding Theory and Applications, Vol. 11,No. 5, pp 903–920, 2019
Go to publication

Upper bounds on the smallest size of a complete cap in PG(N,q), N ≥3, under a certain probabilistic conjecture, Australasian Journal of Combinatorics, vol. 72, Part 3, 2018, pp. 516--535
Go to publication Download (345.2 KB)

New covering codes of radius R, codimension tR and tR+R/2, and saturating sets in projective spaces, electronic publication, arXiv:1808.09301v1 [math.CO], 28 pages, 1 table, 30 references, August 2018
Go to publication Download (368.4 KB)

On the Smallest Size of an Almost Complete Subset of a Conic in PG(2,q) and Extendability of Reed–Solomon Codes, Problems of Information Transmission, 2018, Vol. 54, No. 2, pp. 101–115
Go to publication Download (314.3 KB)

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5, electronic publication, arXiv:1712.07078v3 [cs.IT], 27 pages, 8 figures, 4 tables, 25 references, August 2018
Go to publication Download (631.1 KB)

New Results on Binary Codes Obtained by Doubling Construction, , Cybernetics and Information Technologies, Vol. 18, No 5, pp. 63-76, 2018
Go to publication Download (507.6 KB)

On Almost Complete Caps in PG(N, q), Cybernetics and Information Technologies, Vol. 18, No 5, pp. 54-62, 2018
Go to publication Download (475.7 KB)

Classification of minimal 1-saturating sets in PG(v,2), 2 ≤ v ≤ 6, electronic publication, arXiv:1802.04214[math.CO], 25 pages, 6 tables, 35 references, February 2018
Go to publication Download (188.7 KB)

Tables, bounds and graphics of sizes of complete arcs in the plane PG(2,q) for all q ≤ 321007 and sporadic q in [323761 ... 430007] obtained by an algorithm with fixed order of points (FOP), electronic publication, arXiv:11404.0469[math.CO], 111 pages, 8 figures, 6 tables, 92 references, January 2018
Go to publication Download (1.5 MB)

On Almost Complete Subsets of a Conic in PG(2, q), Completeness of Normal Rational Curves and Extendability of Reed-Solomon Codes, electronic publication, arXiv:1609.05657[math.CO], 39 pages, 2 figures, 4 tables, 23 references, December 2017
Go to publication Download (569.7 KB)

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5, electronic publication, arXiv:1712.07078 [cs.IT], 22 pages, 7 figures, 2 tables, 24 references, December 2017
Go to publication Download (555 KB)

New Bounds for Linear Codes of Covering Radius 2. In: Proceedings of 5th International Castle Meeting, ICMCTA 2017, Coding Theory and Applications, Vihula, Estonia, August 28–31, 2017, Angela I. Barbero, Vitaly Skachek, Oyvind Ytrehus (Eds.) pp. 1-10, Lecture Notes in Computer Science, vol. 10495, 2017, Springer, Cham
Go to publication Download (169.9 KB)

Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4, Proceedings of 2017 IEEE International Symposium on Information Theory (ISIT), June 25--30, 2017, Aachen, Germany, pp. 2193--2197, ISBN 978-1-5090-4096-4, ISSN 2157-8117
Go to publication Download (237.1 KB)

Further results on binary codes obtained by doubling construction, Proceedings Eighth International Workshop on Optimal Codes and Related Topics, OC2017 (in Second International Conference “Mathematics Days in Sofia”), July 10-14, Sofia, Bulgaria, pp.73-80, 2017
Go to publication Download (157.9 KB)

Upper bounds on the smallest size of an almost complete cap in PG(N,q), Proceedings Eighth International Workshop on Optimal Codes and Related Topics , OC2017 (in Second International Conference “Mathematics Days in Sofia”), July 10-14, Sofia, Bulgaria, pp. 67-72, 2017
Go to publication Download (145.7 KB)

Estimating the Fraction of Erasure Patterns Correctable by Linear Codes, Journal of Communications Technology and Electronics, 2017, vol. 62, No. 6, pp. 669–685
Go to publication Download (510.2 KB)

Upper bounds on the smallest size of a complete cap in PG(N,q), N ≥ 3, under a certain probabilistic conjecture, electronic publication, arXiv:1706.01941 [math.CO], 22 pages, 42 references, 3 figures , June 2017
Go to publication Download (293 KB)

Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3, Electronic Notes in Discrete Mathematics, vol. 57, Algebraic and Combinatorial Coding Theory, pp. 15–20, 2017
Go to publication Download (236.5 KB)

Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q), Electronic Notes in Discrete Mathematics, vol. 57, Algebraic and Combinatorial Coding Theory, pp. 21–26, 2017
Go to publication Download (235.5 KB)

Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4, electronic publication, arXiv:1703.04106v2 [cs.IT], 5 pages, 11 references, 2 tables, June 2017
Go to publication Download (123.3 KB)

Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension, electronic publication, arXiv:1702.07939 [math.CO], 14 pages, 34 references, 1 figure, February 2017
Go to publication Download (295.7 KB)

Conjectural upper bounds on the smallest size of a complete cap in PG(N,q), N>=3, in Proceedings XV Int. Workshop on Algebraic and Combinatorial Coding Theory, ACCT2016, Albena, Bulgaria, June 18--24, 2016, pp. 27--34.
Download (411.4 KB)

Upper bounds on the smallest size of a complete cap in PG(3; q) and PG(4; q), in Proceedings XV Int. Workshop on Algebraic and Combinatorial Coding Theory, ACCT2016, Albena, Bulgaria, June 18--24, 2016, pp. 19--26.
Download (283 KB)

Design and Analysis of Codes with Distance 4 and 6 Minimizing the Probability of Decoder Error,Journal of Communications Technology and Electronics, 2016, vol. 61, No. 12, pp. 1440–1455
Go to publication Download (381 KB)

Tables, bounds and graphics of the smallest known sizes of complete caps in the spaces PG(3,q) and PG(4,q), electronic publication, arXiv:1610.09656[math.CO], 26 pages, October 2016
Go to publication Download (293.8 KB)

New Upper Bounds on the Smallest Size of a Saturating Set in a Projective Plane, Proceedings of 2016 XV International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), 26-29 September 2016, Saint-Petersburg, Russia. pp. 18-22.
Go to publication Download (138.8 KB)

Further results on multiple coverings of the farthest-off points, Advances in Mathematics of Communications, doi:10.3934/amc.2016030, vol. 10, no. 3, pp. 613-632, 2016
Go to publication Download (505 KB)

Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search, DOI: 10.1007/s00022-015-0277-z, Journal of Geometry, vol. 107, no. 1, pp. 89-117, 2016
Go to publication Download (1.2 MB)

On constructions and parameters of symmetric configurations v_k, Designs Codes Cryptography, DOI 10.1007/s10623-015-0070-x, vol. 80, no. 1, pp. 125-147, 2016
Go to publication Download (144 KB)

Tables, bounds and graphics of sizes of complete lexiarcs in the plane PG(2, q) for all q ≤ 301813 and sporadic q in the interval [301897 . . . 430007] obtained by an algorithm with fixed order of points (FOP), electronic publication, arXiv:1404.0469v2[math.CO], 114 pages, July 2015
Go to publication Download (1.5 MB)

Tables, bounds and graphics of the smallest known sizes of complete arcs in the plane PG(2,q) for all q ≤ 160001 and sporadic q in the interval [160801...430007], electronic publication, arXiv:1312.2155v3 [math.CO], 85 pages, June 2015
Go to publication Download (1 MB)

Multiple coverings of the farthest-off points with small density from projective geometry, Advances in Mathematics for Communications, vol. 9, no. 1, pp. 63-85, 2015.
Go to publication Download (432.7 KB)

New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane, Journal of Geometry, 2015, vol. 106, no. 1, pp. 1-17
Go to publication Download (1.2 MB)

Upper bounds on the smallest size of a complete arc in PG(2,q) under a certain probabilistic conjecture, Problems of Information Transmission, 2014, vol. 50, no. 4, pp 320-339
Go to publication Download (539.9 KB)

Tables of parameters of symmetric configurations v_k, electronic publication, arXiv:1312.3837v2 [math.CO], 38 pages, September 2014
Go to publication Download (381.8 KB)

Upper bounds on the smallest sizes of a complete arc in PG(2,q) based on computer search, in Proceedings XIV International Workshop on Algebraic and Combinatorial Coding Theory, ACCT2014, Svetlogorsk , Russia, 2014,32-40
Go to publication Download (363.9 KB)

Conjectural upper bounds on the smallest size of a complete arc in PG(2,q) based on an analysis of step-by-step greedy algorithms, in Proceedings XIV International Workshop on Algebraic and Combinatorial Coding Theory, ACCT2014, Svetlogorsk , Russia, 2014, 24-31
Go to publication Download (188.6 KB)

Incremental calculation of decoding failure probability for iterative decoding of Reed-Solomon product code, in Proceedings XIV International Workshop on Algebraic and Combinatorial Coding Theory, ACCT2014, Svetlogorsk , Russia, 2014, 7-13
Go to publication Download (169.4 KB)

Tables of sizes of small complete arcs in the plane PG(2, q), q ≤ 410009, electronic publication, arXiv:1312.2155v2 [math.CO], 89 pages, August 2014
Go to publication Download (760.3 KB)

Tables of sizes of random complete arcs in the plane PG(2,q), electronic publication, arXiv:1405.5862 [math.CO], 37 pages, 2014
Go to publication Download (361.6 KB)