Publications

 Monographs

  1. G. Kabatiansky, E. Krouk, A. Ovchinnikov, S. Semenov, Block Codes // In Modulation and Coding Techniques in Wireless Communications, pp. 83-159, 2010
  2. G. Kabatiansky, E. Krouk and S. Semenov, Error Correcting Codes and Security for Data Networks // Wiley&Sons, ISBN 0-470-86754-X, 512 pages, 2005.
  3. G. Kabatiansky and J. A. Rush, Sphere Packing and Coding Theory // In Handbook on Discrete and Computational Geometry, Second edition, CRC Press, pp. 1355-1376, 2004


Selected journal publications

  1. A. Frolov and V. Zyablov, On the multiple threshold decoding of LDPC codes over GF(q) // Advances in Mathematics of Communications, 2017, 11:1, 123-137.
  2. E. Egorova, G. Kabatiansky, Analysis of Two Tracing Traitor Schemes via Coding Theory // Lecture Notes in Computer Science, p. 84-92, 2017
  3. J. Moreira, M. Fernandez, G. Kabatiansky, Constructions of almost secure frameproof codes with applications to fingerprinting schemes // Designs, Codes and Cryptography.First Online: 20 April 2017
  4. V. Gritsenko, G. Kabatiansky, V. Lebedev and A. Maevskiy, Signature codes for noisy multiple access adder channel // Designs, Codes and Cryptography, 82(1), pp.293-299, 2017.
  5. I. Tamo, A. Barg and A. Frolov, Bounds on the Parameters of Locally Recoverable Codes // IEEE Transactions on Information Theory, 2016, 62:6, 3070-3083.
  6. A. Frolov, Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes // Problems of Information Transmission, 2016, 52:1, 6–13.
  7. J. Moreira, M. Fernandez, G. Kabatiansky, Almost separating and almost secure frameproof codes over q-ary alphabets // Designs, Codes, and Cryptography, vol. 80, N1, pp 11-28, 2016.
  8. P. Pybin, V. Zyablov, Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes // Problems of Information Transmission, 2015, 51:3, 205-216.
  9. V. Akulin, G. Kabatiansky, and A. Mandilara, Essentially entangled component of multipartite mixed quantum states, its properties, and an efficient algorithm for its extraction // Phys. Rev. A 92, 042322, Vol. 92, Iss. 4, October 2015
  10. G. Kabatiansky, V. Lomakov, S. Vladuts, On codes correcting errors in channel and syndrome // Problems of Information Transmission, v.51, N.2, pp.50-57, 2015.
  11. A .Frolov and V. Zyablov, On the capacity of a multiple-access vector adder channel // Problems of Information Transmission, 2014, 50:2, 133–143.
  12. A. Frolov and V. Zyablov, A Coding Technique for Q-Frequency S-User Gaussian Channel // Journal of Communications Technology and Electronics, 2014, Vol. 59, No. 12, pp. 1483–1488.
  13. D. Osipov, A. Frolov and V. Zyablov, On the user capacity for a multiple-access system in a vector disjunctive channel with errors // Problems of Information Transmission, 2013, 49:4, 308–321.
  14. A.Barg, G. Kabatiansky, Robust parent identifying codes and combinatorial arrays // IEEE Transactions on Information Theory, vol.59,N 2, pp. 994-1003, 2013.
  15. V. Zyablov, P. Rybin, Estimation of the exponent of the decoding error probability for a special generalized LDPC code // Journal of Communications Technology and Electronics, 2012,57:8, 946-952
  16. D. Osipov, A. Frolov and V. Zyablov, Multiple access system for a vector disjunctive channel // Problems of Information Transmission, 2012, 48:3, 243–249.
  17. V. Zyablov and A. Frolov, A signal-code construction for a multiple-access system using a vector channel with an additive white Gaussian noise // Journal of communications technology and electronics, 2012, 57:8, 953-957.
  18. A. Frolov and V. Zyablov, Bounds on the minimum code distance for nonbinary codes based on bipartite graphs // Problems of Information Transmission, 2011, 47:4, 327–341.
  19. A. Frolov and V. Zyablov, Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes // Problems of Information Transmission, 2010, 46:2, 142–159.


Selected conference proceedings

  1. F. Ivanov and P. Rybin, On the Nested Family of LDPC Codes Based on Golomb Rulers // In Proc. 2017 IVth International Conference on Engineering and Telecommunication (EnT), 2017, pp. 67-71
  2. E. Egorova, M. Fernandez, Moon Ho Lee, Multimedia fingerprinting with noise via signature codes for weighted noisy adder channels and compressed sensing // The Tenth International Workshop on Coding and Cryptography, Saint-Petersburg, Russia, September 18-22, 2017.
  3. S. Kruglik and A. Frolov, Bounds and Constructions of Codes with All-Symbol Locality and Availability //  In Proc. IEEE Int. Symp. Inf. Theory, Aachen, Germany, June 25-30, 2017, pp. 1023-1027.
  4. S. Kruglik, M. Dudina, V. Potapova, A. Frolov, On One Generalization of LRC Codes with Availability // In Proc. IEEE Information Theory Workshop (ITW), Kaohsiung, Taiwan. pp.1-5, November 6-10, 2017.
  5. S. Kruglik, V. Potapova, A. Frolov, A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes // The Tenth International Workshop on Coding and Cryptography, Saint-Petersburg, Russia, September 18-22, 2017.
  6. E. Egorova, M. Fernandez, G. Kabatiansky and Moon Ho Lee, Signature codes for the A- channel and collusion-secure multimedia fingerprinting codes // Proceedings IEEE International Symposium on Information Theory (ISIT 2016), pp. 3043-3047, 2016.
  7. E. Egorova, M. Fernandez, G. Kabatiansky, Multimedia fingerprinting codes resistant against colluders and noise // Proceedings 2016 IEEE International Workshop on Information Forensics and Security, pp.1-5, 2016.
  8. E. Egorova, V. Potapova, Signature codes for a special class of multiple access channel // Proceedings 2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), pp. 38-42, 2016.
  9. A. Frolov, P. Rybin, F. Ivanov, On Iterative LDPC-Based Joint Decoding Scheme for Binary Input Gaussian Multiple Access Channel // 2016 XV International Symposium “Problems of Redundancy in Information and Control Systems” (REDUNDANCY), Saint-Petersburg, Russia. September 26-29, 2016. P. 48-52.
  10. V. Gritsenko, G. Kabatiansky, V. Lebedev and A. Maevskiy, On codes for multiple access adder channel with noise and feedback // Proceedings of International Workshop on Coding and Cryptography (WCC-2015), Paris, Apr.2015.
  11. M. Fernandez, G. Kabatiansky and J. Moreira, Almost IPP-codes or provably secure digital fingerprinting codes // Proceedings IEEE International Symposium on Information Theory (ISIT 2015), pp. 1595-1599, IEEE Computer Society, 2015.
  12. G. Kabatiansky, S. Vladuts, C. Tavernier, On the Doubly Sparse Compressed Sensing Problem // IMAAC 2015, LNCS, vol. 9496, pp. 1-6, 2015.
  13. A. Frolov and V. Zyablov, 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. pp.1-5, April 26-May 1 2015.
  14. A. Frolov and V. Zyablov, On the Multiple Threshold Decoding of LDPC codes over GF(q) // In Proc. IEEE Int. Symp. Inf. Theory, Hong Kong, China, June 14-19 2015, pp. 2673-2677.
  15. A. Frolov, An Upper Bound on the Minimum Distance of LDPC Codes over GF(q) // In Proc. IEEE Int. Symp. Inf. Theory, Hong Kong, China, June 14-19 2015, pp. 2885-2888.
  16. M. Fernandez, E. Egorova, G. Kabatiansky, Binary fingerprinting codes-can we prove that someone is guilty?! // Proceedings 2015 IEEE International Workshop on Information Forensics and Security (WIFS), pp. 1-4, 2015
  17. I. Zhilin, P. Rybin, V. Zyablov, High-rate codes for high-reliability data transmission // IEEE International Symposium on Information Theory – Proceedings 2015-June,7282456, pp. 256-260
  18. G. Kabatiansky, C. Tavernier,  Double Sparse Compressed Sensing Problem // Proc. 14th Intern. Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2014), Svetlogorsk, Russia, pp. 181-185, 2014, ISBN 978-5-901158-26-5.
  19. A. Frolov, 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
  20. A. Frolov, 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.
  21. A. Frolov, 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. P. 43-46
  22. P. Rybin, V. Zyablov, On the upper bound on undetected error probability for LDPC code //  IEEE International Symposium on Information Theory – Proceedings, pp. 3160-3164, 2014
  23. P. Pybin, On the error-correcting capabilities of low-complexity decoded irregular LDPC codes // IEEE International Symposium on Information Theory – Proceedings, pp.3165-3169, 2014
  24. P.  Rybin, The error-correcting capabilities of low-complexity decoded H-LDPC code as irregular LDPC code // in Proc. 14th International Symposium on Problems of Redundancy in Information and Control Systems, REDUNDANCY 2014, pp. 83-88, 2014
  25. J. Moreira, M. Fernandez, G. Kabatiansky, Constructions of almost secure frameproof codes based on small-bias probability spaces  // LNCS, vol. 8231, pp. 53-67, 2013.
  26. G. Kabatiansky, What to do if syndromes are corrupted also // Proc. 7h Int. Workshop on Optimal Codes and Related Topics, Albena, Bulgaria, pp 102-106, 2013, ISSN 1313-1117.
  27. D. Osipov, A. Frolov, V. Zyablov, On the Capacity of a PPM UWB Multiple-Access System with a Single User Noncoherent Reception. // In Proc. «Wireless Access Flexibility First International Workshop». Kaliningrad, 2013. P. 49-57.
  28. A. Frolov, V. Zyablov, V. Sidorenko, R. Fischer, On a multiple-access in a vector disjunctive channel. // In Proc. IEEE International Symposium on Information Theory. Istanbul, Turkey, July 7-12, 2013. P. 211-215.
  29. A.S. Abdouli, I. Dumer, G. Kabatiansky, C. Tavernier, The Goldreich-Levin Algorithm with reduced complexity // Proc. 13th Intern. Workshop on Algebraic and Combinatorial Coding The- ory (ACCT 2012), Pomorie, Bulgaria, June 2012.
  30. D. Osipov, A. Frolov, V. Zyablov, A Multiple Access System for Disjunctive Vector Channel // XIII International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2012) June 15 – 21, 2012, Pomorie, Bulgaria. P. 269-274.
  31. Ilya Dumer, Grigory Kabatiansky, Cedric Tavernier, Soft-decision list decoding of Reed-Muller codes with linear complexity //  Proceedings 2011 IEEE International Symposium on Information Theory, pp. 2303-2307, 2011
  32. Marcel Fernandez, Grigory Kabatiansky, Jose Moreira Almost separating and almost secure frameproof codes // Proceedings 2011 IEEE International Symposium on Information Theory, pp. 2696-2700, 2011.
  33. Frolov A., Zyablov V. Upper and Lower Bounds on the Minimum Distance of Expander Codes // Proc. of IEEE International Symposium on Information Theory  2011, P. 1302–1306.
  34. J. Moreira, G. Kabatiansky, M. Fernandez, Lower bounds on almost-separating binary codes // Proceedings 2011 IEEE International Workshop on Information Forensics and Security, pp. 1-6, 2011.
  35. A. Barg and G. Kabatiansky, Digital Fingerprinting under and (Somewhat) Beyond the Marking Assumption // S. Fehr (ed.), ICITS 2011, LNCS, vol. 6673, pp. 202-205, 2011.
  36. P. Rybin, V. Zyablov, Asymptotic estimation of error fraction corrected by binary LDPC code // Proceedings 2011 IEEE International Symposium on Information Theory, pp. 351-255, 2011.
  37. A. Barg, G. R. Blakley, G. Kabatiansky, C. Tavernier, Robust parent-identifying codes // Proceedings Information Theory Workshop (ITW), 2010 IEEE ,pp: 1 – 4, 2010.
  38. A. Frolov, V. Zyablov, Insertion of Erasures as a Method of Q-ry LDPC Codes Decoding // Proc. of XII International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2010), Akademgorodok, Novosibirsk, Russia. 2010.– Sept. P. 138–143