Авторы: Bartoli D., Davydov A., Marcugini S., Pambianco F.
On cosets weight distributions of the doubly-extended Reed-Solomon codes of codimension 4, , electronic publication,
arXiv:2007.08798 [cs.IT], 22 pages, 2 tables, 36 references, July 2020 Перейти к публикацииЗагрузить (253.1 KB)
On integral weight spectra of the MDS codes
cosets of weight 1, 2, and 3, electronic publication, arXiv:2007.02405 [cs.IT], 12 pages, 21 references, July 2020 Перейти к публикацииЗагрузить (152.6 KB)
2020 г.
Авторы: Bartoli D., Davydov A., Marcugini S., Pambianco F.
On planes through points off the twisted cubic in PG(3,q)
and multiple covering codes, Finite Fields and Their Applications, vol. 67,. Oct. 2020. Перейти к публикации
2020 г.
Авторы: 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.07078v6 [cs.IT], 51 pages, 14 figures, 5 tables, 35 references, June 2020 Перейти к публикацииЗагрузить (1.2 MB)
A Multi-code Multi-tone DHA FH OFDMA System with Nonparametric Reception // In proc. of the Moscow Workshop on Electronic and Networking Technologies (MWENT), Moscow, Russia, 2020, pp. 1-5, doi: 10.1109/MWENT47943.2020.9067339. Перейти к публикации
2020 г.
Авторы: Bartoli D., Davydov A., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (296.4 KB)
Д. С. Осипов, “Верхняя граница вероятности ошибки в системах связи, использующих однопользовательский прием на основе порядковых статистик”, Автомат. и телемех., 2020, № 1, 134–146 Перейти к публикации
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
Перейти к публикации
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 Перейти к публикации
Osipov D. Coded Modulation for FH OFDMA with Nonparametric Reception, in: The 11th International Congress on Ultra Modern Telecommunications and Control Systems, October 28 - 30, 2019, Dublin, Ireland / Ed. by J. Murphy, E. Kucheryavy, J. Misurec. IEEE Information Theory Society, 2019. Перейти к публикации
Osipov D. Coded Multi-tone Transmission in a DHA FH OFDMA system employing order statistics, in: Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", Moscow, Russia / Ed. by E. Krouk, G. A. Kabatiansky, A. P. Kuleshov, G. Kramer. IEEE Information Theory Society, 2019. P. 36-41 Перейти к публикации
Osipov D. Multiuser wireless channel simulation for communication systems with nonparametric reception // Journal of Physics: Conference Series. 2019. Vol. 1163. No. 1. P. 1-6. Перейти к публикацииЗагрузить (641.7 KB)
2019 г.
Авторы: Bartoli D., Davydov A., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (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 Перейти к публикации
2019 г.
Авторы: 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.07078v5 [cs.IT], 49 pages, 14 figures, 5 tables, 35 references, Dec.2019 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (301.7 KB)
2019 г.
Авторы: Bartoli D., Davydov A., Giulietti M., Marcugini S., Pambianco F.
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 Перейти к публикации
Osipov D. Decoding Techniques for Coded FH OFDMA with Nonparametric Reception, in: Proceedings of the 10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), Moscow, Russia. IEEE, 2018. Перейти к публикации
Ingacheva A., Kokhan V., Osipov D. Mapping of enclosed buildings using mobile radio tomography, in: Proceedings of the 32nd European Conference on Modelling and Simulation (ECMS 2018),Wilhelmshaven, Germany 22 – 25 May 2018. NY : Curran Associates, Inc., 2018. P. 183-189. Перейти к публикации
2018 г.
Авторы: 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, Australasian Journal of Combinatorics, vol. 72, Part 3, 2018, pp. 516--535 Перейти к публикацииЗагрузить (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 Перейти к публикацииЗагрузить (368.4 KB)
2018 г.
Авторы: Bartoli D., Davydov A., Marcugini S., Pambianco F.
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 Перейти к публикацииЗагрузить (314.3 KB)
2018 г.
Авторы: 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.07078v3 [cs.IT], 27 pages, 8 figures, 4 tables, 25 references, August 2018 Перейти к публикацииЗагрузить (631.1 KB)
New Results on Binary Codes Obtained by Doubling Construction, , Cybernetics and Information Technologies, Vol. 18, No 5, pp. 63-76, 2018 Перейти к публикацииЗагрузить (507.6 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 Перейти к публикацииЗагрузить (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)
