Fedor Ivanov

Prof. Fedor Ivanov


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 July 2020
Verified
Book Chapter
Closed access
PDF file
FIFedor Ivanov
Fedor Ivanov
GKGrigory Kabatiansky
Grigory Kabatiansky
EKEugeny Krouk
Eugeny Krouk
NRNikita Rumenko
Nikita Rumenko

20 August 2024 in IEEE Access
Verified
Journal Article
Open access
Oleg EvsutinOleg Evsutin
Oleg Evsutin
FIFedor Ivanov
Fedor Ivanov
KDKristina Dzhanashia
Kristina Dzhanashia
Protecting ownership of digital content is challenging in today’s online world, especially when sharing content through social networks and instant messengers. One possible solution is the use of watermarking; however, if the watermarking method is not robust enough, the watermark can get damaged or erased during transmission. This study introduces a template-based watermarking method with neural network-based extraction, strengthened by error-correcting polar codes, that is designed to work well on major social networks like Facebook, Facebook Messenger, VK, Telegram, Snapchat, Pinterest, and WhatsApp. The method can embed imperceptible (PSNR=39.66) watermarks ranging from 650 to 1600 bits for high-definition images (1920-by-1080 pixels) with small probability (0.01) of erroneous extraction after being transferred through social networks. The key feature of the method is its ability to work with real communication channels, as shown during its testing.

1 April 2022 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
VZV. V. Zyablov
V. V. Zyablov
FIFedor Ivanov
Fedor Ivanov
EKE. A. Krouk
E. A. Krouk
Vladimir SidorenkoVladimir Sidorenko
Vladimir Sidorenko
We consider the problem of constructing a cryptosystem with a public key based on error-resistant coding. At present, this type of cryptosystems is believed to be able to resist the advent of quantum computers and can be considered as a method of post-quantum cryptography. The main drawback of a code-based cryptosystem is a great length of the public key. Most papers devoted to reducing the cryptosystem key length consisted in replacing the Goppa codes used in the original cryptosystem with some other codes with a requirement that the system remains secure against attacks by a quantum computer. Here we propose another approach to the key length reduction that is stated as a task of a simple description of an error set which has either errors of weights greater than half the minimum distance or errors that cannot be corrected without an additional secret knowledge. If a code structure allows to give such a description of an error set, then the complexity of most attacks (for instance, information-set decoding) significantly increases.

23 February 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ITIlya Sergeevich Timokhin
Ilya Sergeevich Timokhin
FIFedor Ivanov
Fedor Ivanov
Polar codes have established themselves as a cornerstone in modern error correction coding due to their capacity-achieving properties and practical implementation advantages. However, decoding polar codes remains a computationally intensive task. In this paper, we introduce a novel approach to improve the decoding efficiency of polar codes by integrating the threshold-based SC-Creeper decoding algorithm, originally designed for convolutional codes. Our proposed decoder with an additional cost function seamlessly merges two established decoding paradigms, namely the stack and Fano approaches. The core idea is to leverage the strengths of both decoding techniques to strike a balance between computational efficiency and performance, with an additional method of controlling movement along a code tree. Simulations demonstrate the superiority of the proposed improved SC-Creeper decoder with tuned parameters. The improved SC-Creeper decoder achieves the performance of the CA-SCL-8 decoder in terms of high code rates and overcomes it in terms of the N=1024 code length, while simultaneously surpassing the efficiency of the traditional Fano decoding algorithm.

1 October 2013 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
FIFedor Ivanov
Fedor Ivanov
VZV. V. Zyablov
V. V. Zyablov
An algorithm for generating parity-check matrices of regular low-density paritycheck codes based on permutation matrices and Steiner triple systems S( v, 3, 2), v = 2 m− 1, is proposed. Estimations...

1 September 2012
Verified
Conference Paper
Closed access
FIFedor Ivanov
Fedor Ivanov
VZVictor Zyablov
Victor Zyablov
VPVladimir Potapov
Vladimir Potapov
Two criteria of cyclic subgroups independence are proved. The ensemble of regular binary LDPC codes which are based on independent subgroups, is built. The condition of absence of the cycles of the length 4 is proved for the resulting code construction. The results of the received code constructions are presented for the iterative algorithm Sum-Product when the codeword is transmitted over channel with additive Gaussian white noise (AGWN).