default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFedor I. Ivanov
Person information
- affiliation: Russian Academy of Sciences, Kharkevich Institute for Information Transmission Problems, Moskow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Ilya Timokhin
, Fedor I. Ivanov:
Fast Polar Decoding With Successive Cancellation List Creeper Algorithm. IEEE Access 12: 86639-86648 (2024)- [j8]Oleg Evsutin, Fedor I. Ivanov, Kristina Dzhanashia:
Watermarking for Social Networks Images With Improved Robustness Through Polar Codes. IEEE Access 12: 118154-118168 (2024) - 2023
- [j7]Ilya Timokhin, Fedor I. Ivanov:
On the improvements of successive cancellation Creeper decoding for polar codes. Digit. Signal Process. 137: 104008 (2023) - 2022
- [j6]A. A. Kurmukova, Fedor I. Ivanov, Victor V. Zyablov:
Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel. Probl. Inf. Transm. 58(2): 122-136 (2022) - [j5]Victor V. Zyablov, Fedor I. Ivanov, E. A. Krouk, Vladimir R. Sidorenko:
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding. Probl. Inf. Transm. 58(2): 184-201 (2022) - [i3]Fedor I. Ivanov, Dmitry Osipov:
Comparison of different coding schemes for 1-bit ADC. CoRR abs/2211.10712 (2022) - [i2]Anastasia Kurmukova, Fedor I. Ivanov, Victor V. Zyablov:
Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes. CoRR abs/2211.10718 (2022) - 2021
- [j4]Fedor I. Ivanov, Valerii Morishnik, Evgenii Krouk:
Improved generalized successive cancellation list flip decoder of polar codes with fast decoding of special nodes. J. Commun. Networks 23(6): 417-432 (2021) - [c15]Fedor I. Ivanov, Eugenii Krouk, Victor V. Zyablov:
New Code-Based Cryptosystem Based on Binary Image of Generalized Reed-Solomon Code. REDUNDANCY 2021: 66-69 - 2020
- [c14]Fedor I. Ivanov, Grigory Kabatiansky, Eugeniy Krouk, Nikita Rumenko:
A New Code-Based Cryptosystem. CBCrypto 2020: 41-49 - [c13]Anastasiia Smeshko, Fedor I. Ivanov, Victor V. Zyablov:
Theoretical Estimates of Burst Error Probability for Convolutional Codes. ISITA 2020: 136-140 - [c12]Anastasiia Smeshko, Fedor I. Ivanov, Victor V. Zyablov:
Upper and Lower Estimates of Frame Error Rate for Convolutional Codes. ISITA 2020: 160-164 - [i1]Fedor I. Ivanov, Eugenii Krouk:
New Code-Based Cryptosystem with Arbitrary Error Vectors. CoRR abs/2006.00514 (2020)
2010 – 2019
- 2019
- [c11]Anastasiia Smeshko, Fedor I. Ivanov:
Signal-Code Construction Based on Codes on Gilbert-Varshamov Bound for Multiple Access System over Vector-Disjunctive Channel. BlackSeaCom 2019: 1-3 - [c10]Fedor I. Ivanov, Pavel Sergeevich Rybin:
On the Asymptotic Capacity of Slotted Multiple Access Channel. CITS 2019: 1-5 - [c9]Fedor I. Ivanov, Pavel S. Rybin, Valentin B. Afanassiev:
On the Performance of Slotted Vector-Disjunctive Channel. CWIT 2019: 1-5 - [c8]Fedor I. Ivanov, Alexey Kreshchuk, Pavel S. Rybin, Valentin B. Afanassiev:
On the Capacity Estimation of a Slotted Multiuser Communication Channel. ICUMT 2019: 1-5 - [c7]Fedor I. Ivanov, Pavel S. Rybin, Valentin B. Afanassiev, Alexey Kreschuk:
On the Capacity Estimation of a Slotted Multiuser Communication Channel with Noise. REDUNDANCY 2019: 27-31 - [c6]Anastasiia Smeshko, Fedor I. Ivanov, Victor V. Zyablov:
The influence of active distances on the distribution of bursts. REDUNDANCY 2019: 110-114 - [c5]Fedor I. Ivanov, Evgenii Krouk, Alexey Kreshchuk:
On the Lightweight McEliece Cryptosystem for Low-Power Devices. REDUNDANCY 2019: 133-138 - 2018
- [c4]Fedor I. Ivanov, Pavel S. Rybin:
On the Maximal Achievable Rate for Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System Over Vector-Disjunctive Channel. BlackSeaCom 2018: 1-5 - [c3]Fedor I. Ivanov, Pavel S. Rybin:
Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System over Vector-Disjunctive Channel. ICC Workshops 2018: 1-5 - [c2]Fedor I. Ivanov, Alexey Kreshchuk, Victor V. Zyablov:
On the Local Erasure Correction Capacity of Convolutional Codes. ISITA 2018: 296-300 - [c1]Fedor I. Ivanov, Pavel S. Rybin:
Novel Signal-Code Construction for Multiple Access System over Vector-Disjunctive Channel. ISITA 2018: 560-564 - 2017
- [j3]Fedor I. Ivanov:
A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices. Probl. Inf. Transm. 53(3): 229-241 (2017) - 2016
- [j2]Igor V. Zhilin, Fedor I. Ivanov:
Vectorizing computations at decoding of nonbinary codes with small density of checks. Autom. Remote. Control. 77(10): 1781-1791 (2016) - 2013
- [j1]Fedor I. Ivanov, Victor V. Zyablov:
Low-density parity-check codes based on steiner systems and permutation matrices. Probl. Inf. Transm. 49(4): 333-347 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
