![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Alexey Kreshchuk
Person information
- affiliation (PhD 2015): Russian Academy of Sciences, Kharkevich Institute for Information Transmission Problems, Moscow, Russia
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [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]Fedor I. Ivanov, Evgenii Krouk, Alexey Kreshchuk
:
On the Lightweight McEliece Cryptosystem for Low-Power Devices. REDUNDANCY 2019: 133-138 - 2018
- [c5]Fedor I. Ivanov, Alexey Kreshchuk
, Victor V. Zyablov:
On the Local Erasure Correction Capacity of Convolutional Codes. ISITA 2018: 296-300 - 2017
- [j5]Daniele Bartoli
, Alexander A. Davydov
, Alexey Kreshchuk
, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q). Electron. Notes Discret. Math. 57: 21-26 (2017) - [j4]Alexey Kreshchuk
, Vladimir G. Potapov
:
Better goodness-of-fit statistics for coded FSK decoding. Electron. Notes Discret. Math. 57: 139-145 (2017) - [c4]Alexey Kreshchuk
, Igor V. Zhilin
, Victor V. Zyablov
:
On the Performance of Block Woven Codes Constructions with Row-Wise Permutations. ICMCTA 2017: 217-227 - [c3]Igor V. Zhilin
, Alexey Kreshchuk
, Victor V. Zyablov
:
On the code distance of a woven block code construction. ISIT 2017: 16-20 - 2016
- [c2]Igor V. Zhilin, Alexey Kreschuk, Victor V. Zyablov:
Generalized concatenated codes with soft decoding of inner and outer codes. ISITA 2016: 290-294 - 2014
- [j3]Daniele Bartoli
, Alexander A. Davydov
, Giorgio Faina, Aleksei Andreevich Kreshchuk
, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture. Probl. Inf. Transm. 50(4): 320-339 (2014) - [c1]Alexey Kreshchuk
, Victor V. Zyablov
:
Generalized concatenated MIMO system with GMD decoding. ISTC 2014: 259-263 - 2013
- [j2]Alexey A. Kreshchuk
, Vladimir G. Potapov
:
Statistical demodulators for frequency shift keying with fast frequency hopping. Autom. Remote. Control. 74(10): 1688-1695 (2013) - 2011
- [j1]Alexey Kreshchuk
, Alexander A. Davydov
, Victor V. Zyablov
:
Codes for MIMO transmission based on orthogonal sequences. Probl. Inf. Transm. 47(4): 305-326 (2011)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint