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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (1.5 MB)
2017 г.
Авторы: Bartoli D., Davydov A., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (569.7 KB)
2017 г.
Авторы: Bartoli D., Davydov A., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (555 KB)
Osipov D., Titov D.Sequential Decoding on Syndrome Trellises for Nonparametric Detection//In. proc. of the Eighth International Workshop on Optimal Codes and Related Topics July 10-14, 2017, Sofia, Bulgaria pp. 104-10 Загрузить (124.2 KB)
Osipov D. Obtaining reliability values from nonparametric receiver: the “optimal” parameter choice. // Electronic Notes in Discrete Mathematics. 2017. Vol. 57. P. 167-174
2017 г.
Авторы: Bartoli D., Davydov A., Giulietti M., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (510.2 KB)
2017 г.
Авторы: Davydov A., Faina G., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (293 KB)
2017 г.
Авторы: Bartoli D., Davydov A., Faina G., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (123.3 KB)
2017 г.
Авторы: Bartoli D., Davydov A., Giulietti M., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (295.7 KB)
Osipov D. An upper bound on the error probability of a communication system with nonparametric detection, in: Proceedings of the XV International Symposium "Problems of Redundancy in Information and Control Systems" September 26-29, 2016 St. Petersburg, Russia. IEEE Press, 2016. Перейти к публикации
Subbotin A., Osipov D., Generalized Minimum Distance Decoder in a DHA FH OFDMA Employing Concatenated Coding, in: Multiple Access Communications. 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings. Cham : Springer International Publishing AG, 2016. P. 15-29.
2016 г.
Авторы: Bartoli D., Davydov A., Faina G., Marcugini S., Pambianco F.
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. Загрузить (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. Загрузить (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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (293.8 KB)
2016 г.
Авторы: Bartoli D., Davydov A., Giulietti M., Marcugini S., Pambianco F.
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. Перейти к публикацииЗагрузить (138.8 KB)
2016 г.
Авторы: Bartoli D., Davydov A., Giulietti M., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (505 KB)
Построение и анализ кодов с расстоянием 4 и 6, минимизирующих вероятность ошибки декодера,
журнал "Информационные процессы", том 16, № 1, стр. 41–60, Март 2016
Перейти к публикацииЗагрузить (223 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
Перейти к публикацииЗагрузить (1.2 MB)
2016 г.
Авторы: Davydov A., Faina G., Giulietti M., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (144 KB)
Osipov D. On the Channel Capacity of an Order Statistics-Based Single-User Reception in a Multiple Access System, in: Proceedings of the 8th International Workshop, MACOM 2015, Helsinki, Finland, September 3-4, 2015, Vol. 9305. Springer International Publishing, 2015. P. 101-108.
Osipov D. Upper bound on the performance of an order statistics-based decoder, in: Proceedings of the Ninth International Workshop on Coding and Cryptography, April 13-17, 2015, Paris, France. P. : , 2015
Zhilin I.V., Kreshchuk A.A., Zyablov V.V. Generalized error-locating codes and minimization of redundancy for specified input and output error probabilities // Journal of Communications Technology and Electronics. 2015. Т. 60. № 6. С. 695–706. Перейти к публикации
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
Перейти к публикацииЗагрузить (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
Перейти к публикацииЗагрузить (1 MB)
2015 г.
Авторы: Bartoli D., Davydov A., Giulietti M., Marcugini S., Pambianco F.
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. Перейти к публикацииЗагрузить (432.7 KB)
2015 г.
Авторы: Bartoli D., Davydov A., Faina G., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (1.2 MB)
Osipov D. On jamming-proof signal-code constructions for a multiple access system, in: Proceedings XIV International Symposium on Problems of Redundancy in Information and Control Systems (June 1-5 2014). IEEE Press, 2014. P. 74 -77.
Osipov D. Reduced-Complexity Robust Detector in a DHA FH OFDMA System under Mixed Interference, in: Multiple Access Communications Vol. 8715: 7th International Workshop, MACOM 2014, Halmstad, Sweden, August 27-28, 2014. Proceedings. Halmstad : Springer International Publishing, 2014. P. 29-34.
Kreshchuk A.A., Zyablov V.V. Generalized concatenated system with embedded space-time codes for MIMO systems // Journal of Communications Technology and Electronics. 2014. Т. 59. № 12. С. 1489–1500. Перейти к публикации
Kreshchuk A., Zyablov V. Embedded space-time block codes for concatenated systems // 2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems. 2014. Перейти к публикации
Kreshchuk A., Zyablov V., Ryabinkin E. A new iterative decoder for product codes // Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory ACCT2014. — 2014. — Pp. 211–214.
Загрузить (68.6 KB)
Kreshchuk A., Zyablov V. Generalized concatenated MIMO system with GMD decoding // Turbo Codes and Iterative Information Processing (ISTC), 2014 8th International Symposium on. — Aug. 2014. — Pp. 259–263. — DOI: 10.1109/ISTC.2014.6955125.
Перейти к публикации
Kreshchuk A., Zyablov V. Embedded space-time block codes for concatenated systems // Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2014 XIV International Symposium on. — June 2014. — Pp. 62–65. — DOI: 10.1109/RED.2014.7016707.
Перейти к публикации
Zhilin I., Rybin P., Ivanov F., Zyablov V., On the Decoding of Tail-Biting UM-LDPC Codes // Proc. of XIV International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2014), September 07-13, 2014, Kaliningrad, Russia, pp. 336-341. Загрузить (92.9 KB)
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 Перейти к публикацииЗагрузить (539.9 KB)
2014 г.
Авторы: Davydov A., Faina G., Giulietti M., Marcugini S., Pambianco F.
Tables of parameters of symmetric configurations v_k, electronic publication, arXiv:1312.3837v2 [math.CO], 38 pages, September 2014 Перейти к публикацииЗагрузить (381.8 KB)
2014 г.
Авторы: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F., Tkachenko I.
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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (760.3 KB)
