Enter
Login:
Password:
Forgot your password?
scientific activity
structureeducational projectsperiodicalsstaffpress centercontacts
| english
:    Page: 123456 789
2017 year
Authors: Afanassiev V., Davydov A.

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. 2198--2202, ISBN 978-1-5090-4095-7, ISSN 2157-8117
Download (237.1 KB)

2017 year
Authors: Davydov A., Marcugini S., Pambianco F.

Further results on binary codes obtained by doubling construction, Proceedings Eighth International Workshop on Optimal Codes and Related Topics, OC2017, July 10-14, Sofia, Bulgaria, pp.73-80, 2017
Download (157.9 KB)

2017 year
Authors: Davydov A., Marcugini S., Pambianco F.

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, July 10-14, Sofia, Bulgaria, pp. 67-72, 2017
Download (145.7 KB)

2017 year
Authors: Afanassiev V., Davydov A., Zigangirov D.

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

2017 year
Authors: 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
Go to publication Download (293 KB)

2017 year
Authors: 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 - 2016, pp. 1520, 2017
Go to publication Download (236.5 KB)

2017 year
Authors: Bartoli D., Davydov A., Kreshchuk A., Marcugini S., Pambianco F.

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 - 2016, pp. 2126, 2017
Go to publication Download (235.5 KB)

2017 year
Authors: Afanassiev V., Davydov A.

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)

2017 year
Authors: 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
Go to publication Download (295.7 KB)

2016 year
Authors: 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.
Download (411.4 KB)

2016 year
Authors: Bartoli D., Davydov A., Kreshchuk A., Marcugini S., Pambianco F.

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)

2016 year
Authors: Afanassiev V., Davydov A., Zigangirov D.

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. 14401455
Go to publication Download (381 KB)

2016 year
Authors: Bartoli D., Davydov A., Kreshchuk A., Marcugini S., Pambianco F.

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)

2016 year
Authors: 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.
Go to publication Download (138.8 KB)

2016 year
Authors: 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
Go to publication Download (505 KB)

2016 year
Authors: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F.

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)

2016 year
Authors: 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
Go to publication Download (144 KB)

2015 year
Authors: Frolov A.

An Upper Bound on the Minimum Distance of LDPC Codes over GF(q) // In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, June 14-19 2015, pp. 2885-2888.
Go to publication

2015 year
Authors: Frolov A., Zyablov V.

On the Multiple Threshold Decoding of LDPC codes over GF(q) // In Proc. IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, June 14-19 2015, pp. 2673-2677.
Go to publication

2015 year
Authors: Frolov A., Zyablov V.

A new coding method for a multiple-access system with a large number of active users // In Proc. IEEE Information Theory Workshop (ITW), Jerusalem, Israel, April 26-May 1 2015. pp.1-5.
Go to publication

2015 year
Authors: Frolov A.

An Upper Bound on the Minimum Distance of Tail-Biting LDPC Convolutional codes // Information Technology and Systems, September 7-11, Olympic Village, Sochi, Russia, 2015. pp. 2-8.
Go to publication

2015 year
Authors: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F.

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)

2015 year
Authors: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F.

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)

2015 year
Authors: 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.
Go to publication Download (432.7 KB)

2015 year
Authors: 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
Go to publication Download (1.2 MB)

2014 year
Authors: Kreshchuk A., Zyablov V.

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. . 14891500.
Go to publication

2014 year
Authors: Kreshchuk A., Zyablov V.

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.
Go to publication

2014 year
Authors: Kreshchuk A., Zyablov V., Ryabinkin E.

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. 211214.
Download (68.6 KB)

2014 year
Authors: Kreshchuk A., Zyablov V.

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. 259263. DOI: 10.1109/ISTC.2014.6955125.
Go to publication

2014 year
Authors: Zhilin I., Rybin P., Ivanov F., Zyablov V.

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.
Download (92.9 KB)

2014 year
Authors: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F.

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)

2014 year
Authors: Frolov A.

Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes // XIV International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2014) September 7-13, 2014, Kaliningrad, Russia. P. 163-168.
Go to publication

2014 year
Authors: Frolov A.

On the Hamming-Like Upper Bound on the Minimum Distance of LDPC Codes// XIV International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2014) September 7-13, 2014, Kaliningrad, Russia. P. 157-162.
Go to publication

2014 year
Authors: Frolov A., Zyablov V.

A Coding Technique for Q-Frequency S-User Gaussian Channel // Journal of Communications Technology and Electronics, 2014, Vol. 59, No. 12, pp. 14831488.

2014 year
Authors: Frolov A., Zyablov V.

A Coding Technique for Q-Frequency S-User Gaussian Channel // ITaS"2014 Nizhny Novgorod, Russia, September 1-5, 2014. P. 455-459.

2014 year
Authors: Frolov A., Zyablov V.

On the capacity of a multiple-access vector adder channel // Problems of Information Transmission, 2014, 50:2, 133143

2014 year
Authors: Frolov A.

Coding for S-User Vector Adder Channel // // Proc. of XIV International Symposium on Problems of Redundancy in Information and Control Systems, Saint-Petersburg, Russia. 01-05 June 2014.

2014 year
Authors: 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
Go to publication Download (381.8 KB)

2014 year
Authors: 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
Go to publication Download (363.9 KB)

2014 year
Authors: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F.

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)

2014 year
Authors: Afanassiev V., Davydov A.

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)

2014 year
Authors: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F.

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)

2014 year
Authors: Bartoli D., Davydov A., Faina G., Marcugini S., Pambianco F.

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)

2014 year
Authors: Bartoli D., Davydov A., Faina G., Marcugini S., Pambianco F.

Tables of sizes of small complete arcs in the plane PG(2,q), q ≤ 190027, obtained by an algorithm with fixed order of points (FOP), electronic publication, arXiv:1404.0469v1 [math.CO], 66 pages, April 2014
Go to publication Download (414.4 KB)

2013 year
Authors: Ivanov F., Zyablov V.

Low-density parity-check codes based on steiner systems and permutation matrices PROBLEMS OF INFORMATION TRANSMISSION Volume: 49 Issue: 4 Pages: 333-347
Go to publication

:    Page: 123456 789
Search for publications
Year of publication
from
Author

Search phrase

Type of publication


Search in department

Date descending
Date ascending
 

 

  © Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), 2017
About  |  Contacts  |  The old version of this site