default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDE. A. Krouk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j3]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)- 2021
- [j2]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) - 1999
- [j1]Alexander Barg
, E. A. Krouk, Henk C. A. van Tilborg:
On the complexity of minimum distance decoding of long linear codes. IEEE Trans. Inf. Theory 45(5): 1392-1405 (1999)
Conference and Workshop Papers
- 2024
- [c15]Anton Sergeev, Ilya Petrovanov, Eugeniy Krouk:
Numerical Analysis of Transport Coding Efficiency. NEW2AN/ruSMART (2) 2024: 262-274 - 2021
- [c14]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
- [c13]Fedor I. Ivanov, Grigory Kabatiansky, Eugeniy Krouk, Nikita Rumenko:
A New Code-Based Cryptosystem. CBCrypto 2020: 41-49 - [c12]Yaniv Cohen, Arkadi Zilberman, Ben Zion Dekel, Evgenii Krouk:
Artificial Neural Network in Predicting Cancer Based on Infrared Spectroscopy. KES-IDT 2020: 141-153 - 2019
- [c11]Evgenii Krouk, Anton Sergeev, Mikhail Afanasev:
A Transport Coding Gain Estimation in the Conditions of Time Limitation for Maximum Acceptable Message Delay. KES-IDT (2) 2019: 89-99 - [c10]Fedor I. Ivanov, Evgenii Krouk, Alexey Kreshchuk:
On the Lightweight McEliece Cryptosystem for Low-Power Devices. REDUNDANCY 2019: 133-138 - 2016
- [c9]Evgenii Krouk, Andrei Ovchinnikov:
2-Stripes Block-Circulant LDPC Codes for Single Bursts Correction. IIMSS 2016: 11-23 - [c8]Sergei V. Fedorenko, Eugenii Krouk:
An Invariant Subcode of Linear Code. IIMSS 2016: 169-178 - 2014
- [c7]Andrey Abramov, Eugeniy Krouk:
Decoding Random Linear Codes in 0.091n. IDT/IIMSS/STET 2014: 481-492 - 2007
- [c6]Evgenii Krouk, Sergei Semenov:
Application of Tornado Codes to Transport Coding. ISCC 2007: 249-256 - 2005
- [c5]Evgenii Krouk, Sergei Semenov:
Transmission of a message during limited time with the help of transport coding. ICETE 2005: 88-93 - [c4]Evgenii Krouk, Sergei Semenov:
A Joint Coding at Neighbor Network Layers. WOWMOM 2005: 198-204 - 2003
- [c3]Elena Costa, Egon Schulz, Harald Haas, E. A. Krouk, Felix A. Taubin, Peter Trifonov:
MC-CDMA uplink channel coding scheme with built-in channel estimation. ICC 2003: 2086-2090 - 1997
- [c2]Gregory Kabatianskii, E. A. Krouk, Ben J. M. Smeets:
A Digital Signature Scheme Based on Random Error-Correcting Codes. IMACC 1997: 161-167 - 1993
- [c1]I. L. Asnis, Sergei V. Fedorenko, E. A. Krouk, E. T. Mironchikov:
Tables of Coverings for Decoding by S-Sets. Error Control, Cryptology, and Speech Compression 1993: 97-102
Informal and Other Publications
- 2020
- [i1]Fedor I. Ivanov, Eugenii Krouk:
New Code-Based Cryptosystem with Arbitrary Error Vectors. CoRR abs/2006.00514 (2020)
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 2025-09-12 23:11 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:
