Alexey Kreshchuk
Research Subjects
Alexey Kreshchuk has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Victor Vasil'Evich Zyablov
Russian Academy of Sciences
8 shared publications - Alexander A. Davydov
Kharkevich Institute for Information Transmission Problems Russian Academy of Sciences 127051 Moscow Russian Federation
5 shared publications - Vladimir Georgievich Potapov
Russian Academy of Sciences
5 shared publications - Daniele Bartoli
Department of Mathematics and Informatics, University of Perugia, Perugia, Italy
4 shared publications Fedor Ivanov
National Research University Higher School of Economics, Institute for Information Transmission Problems Russian Academy of Sciences,Moscow,Russia
4 shared publications- Igor Zhilin
Autonomous Robotics Research Center (ARRC), Technology Innovation Institute (TII), Abu Dhabi, United Arab Emirates
4 shared publications
Latest Publications
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 11108-11113
On the Secret Sharing Scheme Based on Supercodes Decoding
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 11108-11113
On the Secret Sharing Scheme Based on Supercodes Decoding
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 27-31
On the Capacity Estimation of a Slotted Multiuser Communication Channel with Noise
We consider a vector-disjunctive channel where users transmit some vector of bits of length L. We estimate the capacity of this channel and derive the lower bound on this value in the case of channel noise. We present some numerical results for the bound we obtained in the case of different number of active users and different parameters of channel.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 27-31
On the Capacity Estimation of a Slotted Multiuser Communication Channel with Noise
We consider a vector-disjunctive channel where users transmit some vector of bits of length L. We estimate the capacity of this channel and derive the lower bound on this value in the case of channel noise. We present some numerical results for the bound we obtained in the case of different number of active users and different parameters of channel.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-138
On the Lightweight McEliece Cryptosystem for Low-Power Devices
In this paper we consider a problem of secured data transmission for low-power devices such as RFID (Radio Frequency IDentification) tags or some other devices for Internet of Things (IoT) for which low power consumption plays significant role. In fact, the privacy aspect involved with technology of RFID and IoT could become a major issue in the perspective of a global adoption. We considered well-known McEliece cryptosystems both in classical case (based on Goppa Codes) and based on Quasi-Cyclic Moderate-Density Parity-Check Codes (QC-MDPC) as a major security element of small and low-power devices. We also estimate a trade-off between complexity and security level of suggested system.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-138
On the Lightweight McEliece Cryptosystem for Low-Power Devices
In this paper we consider a problem of secured data transmission for low-power devices such as RFID (Radio Frequency IDentification) tags or some other devices for Internet of Things (IoT) for which low power consumption plays significant role. In fact, the privacy aspect involved with technology of RFID and IoT could become a major issue in the perspective of a global adoption. We considered well-known McEliece cryptosystems both in classical case (based on Goppa Codes) and based on Quasi-Cyclic Moderate-Density Parity-Check Codes (QC-MDPC) as a major security element of small and low-power devices. We also estimate a trade-off between complexity and security level of suggested system.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
On the Capacity Estimation of a Slotted Multiuser Communication Channel
We consider a vector-disjunctive channel where users transmit some vector of bits of length L. We estimate the capacity of this channel and derive the lower bound on this value. We present some numerical results for the bound we obtained in the case of different number of active users and different parameters of channel.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
On the Capacity Estimation of a Slotted Multiuser Communication Channel
We consider a vector-disjunctive channel where users transmit some vector of bits of length L. We estimate the capacity of this channel and derive the lower bound on this value. We present some numerical results for the bound we obtained in the case of different number of active users and different parameters of channel.
- 1 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 8-11
Soft-Decision Statistical Decoder for Coded DHA FH OFDMA
Statistical decoders have good performance in channels with very low signal to interference ratio (SIR) such as uncoordinated multiple access systems like Dynamic Hopset Allocation Frequency Hopping OFDMA (DHA FH OFDMA). But there was no soft-output statistical decoder developed before. In this work we present such decoder. To get accurate likelihood values we also need to change the structure of statistical decoders. We estimate the performance of the proposed decoder by simulating a concatenated code with outer convolutional code. Having soft decision increases energy gain by 1.5 dB.
- 1 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 8-11
Soft-Decision Statistical Decoder for Coded DHA FH OFDMA
Statistical decoders have good performance in channels with very low signal to interference ratio (SIR) such as uncoordinated multiple access systems like Dynamic Hopset Allocation Frequency Hopping OFDMA (DHA FH OFDMA). But there was no soft-output statistical decoder developed before. In this work we present such decoder. To get accurate likelihood values we also need to change the structure of statistical decoders. We estimate the performance of the proposed decoder by simulating a concatenated code with outer convolutional code. Having soft decision increases energy gain by 1.5 dB.
- 23 August 2017
- Published by Springer Nature
- p. 217-227
On the Performance of Block Woven Codes Constructions with Row-Wise Permutations
- 23 August 2017
- Published by Springer Nature
- p. 217-227
On the Performance of Block Woven Codes Constructions with Row-Wise Permutations
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 16-20
On the code distance of a woven block code construction
In this paper we propose a woven block code construction based on two convolutional outer codes and a single inner code. We proved lower and upper bounds on this construction's code distance. The lower bound is shown to be higher than the product of the free distances of inner and outer constituent codes. Since this construction uses well-developed convolutional constituent codes, we believe that it would be competitive to turbo codes in the future mobile communication systems.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 16-20
On the code distance of a woven block code construction
In this paper we propose a woven block code construction based on two convolutional outer codes and a single inner code. We proved lower and upper bounds on this construction's code distance. The lower bound is shown to be higher than the product of the free distances of inner and outer constituent codes. Since this construction uses well-developed convolutional constituent codes, we believe that it would be competitive to turbo codes in the future mobile communication systems.
- 1 March 2017
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 57, 21-26
Upper bounds on the smallest size of a complete cap in PG(3, q ) and PG(4, q )
- 1 March 2017
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 57, 21-26
Upper bounds on the smallest size of a complete cap in PG(3, q ) and PG(4, q )
- 1 March 2017
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 57, 139-145
Better goodness-of-fit statistics for coded FSK decoding
- 1 March 2017
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 57, 139-145
Better goodness-of-fit statistics for coded FSK decoding