?
On the Secret Sharing Scheme Based on Supercodes Decoding
P. 11108–11113.
Secret sharing schemes have been studied intensively for the last 20 years, and these schemes have a number of real-world applications. There are a number of approaches to the construction of secret sharing schemes. One of them is based on codes of forward error correction (FEC). In fact, every linear code can be used to construct secret sharing schemes. For instance original Shamir secret sharing scheme is based on erasure decoding of Reed-Solomon codes. One of the main drawbacks of secret sharing schemes based on FEC is a dependence between number of users (participants) and field size of FEC. In this paper we propose a new scheme of secret sharing based on iterative decoding of LDPC codes in terms of supercodes decoding concept. In this scheme a field size can be made arbitrary and independent on the number of participants.
Morozov V., Oleg Evsutin, Nikita Yarygin, , in: 2025 XIХ International Symposium on Problems of Redundancy in Information and Control Systems (Redundancy), 5-7 Nov. 2025.: IEEE, 2025. P. 1–7.
Quantum Key Distribution (QKD) is a promising field in modern cryptography where the security of key information is guaranteed by the laws of quantum mechanics. One of the key stages in QKD protocols is error estimation and reconciliation in the secret key. This procedure requires the transmission of a certain number of secret key bits ...
Added: December 30, 2025
Veresova A., Ovchinnikov A., , in: 2025 XIХ International Symposium on Problems of Redundancy in Information and Control Systems (Redundancy), 5-7 Nov. 2025.: IEEE, 2025. P. 1–5.
This paper addresses the problem of constructing
codes for correcting single error bursts. The construction is
based on a block-circulant design of low-density parity-check
codes. For such a design, the maximal correctable burst length
is limited by the block size, which forces consideration of codes
whose parity-check matrix contains only a small number of large
blocks. However, this significantly restricts the ...
Added: November 24, 2025
Morozov V., Башара В. О., Емельяненко М. В., В кн.: Параллельные вычислительные технологии – XIX всероссийская научная конференция с международным участием, ПаВТ’2025, г. Москва, 8–10 апреля 2025 г. Короткие статьи и описания плакатов.: Челябинск: Издательский центр ЮУрГУ, 2025. С. 193–210.
Error correction in the secret key is a mandatory step in quantum key distribution (QKD) protocols. Usually, modern error-correcting codes are used for its implementation. Imperfections of the hardware used in QKD systems lead to bit flipping errors in the channel. Moreover, such systems are characterized by an asymmetric distribution of such errors. Taking into ...
Added: June 3, 2025
Ivanov F., Kuvshinov A., Facta Universitatis. Series Electronics and Energetics 2024 Vol. 37 No. 3 P. 483–496
Nowadays concatenated codes are actively developed for different applications of error-correcting theory. In this paper we propose a new method for constructing concatenated codes consisting of some outer error-correcting code and a particular designed inner low-density parity-check (LDPC) code. We consider polarization-adjusted convolutional (PAC) code and LDPC code as outer code of suggested construction. Special ...
Added: November 16, 2024
Nefedov S., Ozhegov R., Evsyutin O. et al., Наноиндустрия 2024 Т. 17 № S10-2 (128) С. 553–558
The paper considers challenges of creating a quantum key distribution system for long-distance trunk line. Besides, it presents the results of design, prototyping and examination of equipment implementing the quantum key distribution protocol with phase-time coding. ...
Added: August 2, 2024
Ivanov F., Kuvshinov A., , in: 2023 16th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).: Niš: IEEE, 2023. P. 228–231.
Concatenated codes are effectively used in different approaches of error-correcting theory. We suggest new concatenated code construction that is composed of outer LDPC code and a particular designed inner LDPC code. Special optimization procedure was developed to obtain inner code with specific error-correcting characteristics. We apply the decoder of woven codes to this construction, while ...
Added: June 21, 2024
Ivanov F., Kuvshinov A., , in: 2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Ekaterinburg: IEEE, 2022. P. 190–194.
In this paper we consider the special construction of concatenated codes. Our scheme consists of outer LDPC code and a specially designed class of inner LDPC code with interleaver between inner and outer codes. An inner code in the proposed construction is obtained using a specific optimization algorithm that allows to minimize SNR for a ...
Added: June 21, 2024
Veresova A., Ovchinnikov A., , in: 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY).: IEEE, 2023. P. 122–126.
This article discusses the application of low-density parity-check (LDPC) codes for error correction, with a focus on the joint correction of both grouped and independent errors in communication and data storage systems.
The error correction capabilities of LDPC codes with different constructions were estimated when correcting single error bursts and independent errors.
Experiments showed that correcting even ...
Added: October 30, 2023
Kowshik S., Kirill Andreev, Frolov A. et al., IEEE Transactions on Communications 2020 Vol. 68 No. 8 P. 4694–4708
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free, and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relevant case of Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding ...
Added: September 9, 2023
Ovchinnikov A., Fominykh A. A., , in: 2023 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2023. P. 1–5.
The common technique to perform decoding in channels with memory is to use interleaving, which increases both complexity and delay at the receiver. To overcome these limitations, coding scheme adaptation approaches might be used. One of the approaches is the optimization of long error-correcting codes and the modification of the decoder, taking into account the ...
Added: July 18, 2023
Ovchinnikov A., Fominykh A. A., , in: 2023 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2023. P. 1–4.
Satellite and space communication systems have received a lot of attention as crucial transmission frameworks in recent years. In these systems, the signal is mostly degraded by fast amplitude and phase changes (fading), which cause error bursts. Hence, robust error-correcting codes that can handle error bursts are necessary for space and satellite transmissions of good ...
Added: July 18, 2023
Osipov D., / Series arXiv "math". 2022. No. 1.
This paper devotes to comparison of different cod- ing schemes (various constructions of Polar and LDPC codes, Product codes and BCH codes) for the case when information is transmitted over AWGN channel with quantization with lowest possible complexity and resolution: 1-bit. We examine performance (in terms of Frame-error-rate — FER) for schemes mentioned above and ...
Added: December 27, 2022
Andrei Ovchinnikov, Fominykh A., , in: Internet of Things, Smart Spaces, and Next Generation Networks and Systems. 20th International Conference, NEW2AN 2020, and 13th Conference, ruSMART 2020, St. Petersburg, Russia, August 26–28, 2020, Proceedings, Part IIssue 12525.: Springer, 2020. P. 393–401.
Hard-decision decoders are considered for burst error correction for low-density parity-check codes. The decoder for block-permutation construction of low-density parity-check proposed. Experiments on complexity and error probability are conducted with burst lengths both within and beyond the burst error correction capability. Also simulation results for Gilbert model are presented. ...
Added: October 27, 2022
A. A. Ovchinnikov, Fominykh A. A., , in: 2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.: IEEE, 2022. P. 1–5.
The paper considers approaches to multistage decoding of linear codes. Cascade and iterative decoding techniques are well-known directions in coding theory. The idea of creating long codes from a combination of numerous short codes was presented in the 1950s. The paper proposes hybrid decoding algorithm that presents an approach to combine different decoding algorithms to use ...
Added: September 27, 2022
Rybin P., Ivanov F., Journal of Communications Technology and Electronics 2018 Vol. 63 No. 12 P. 1518–1523
The error exponent of the regular graph-based binary low-density parity-check (LDPC) codes under the maximum likelihood (ML) decoding algorithm in the binary symmetric channel (BSC) is analyzed. Unlike most other papers where error exponents are considered for the case when the length of LDPC codes tends to infinity (asymptotic analysis), the finite length case (finite ...
Added: March 1, 2019
Krouk E., Ovchinnikov A., , in: Smart Innovation, Systems and Technologies.: Springer, 2015. P. 227–238.
In the paper the usage of low-density parity-check (LDPC) codes to protect storage systems from failures is considered. These codes are the instance of locally recoverable (LRC) codes which obtain much attention during last years regarding storage systems. The system model of distributed storage system is described, with specific types of failures. The coding schemes ...
Added: October 30, 2018
Tchernykh A., Babenko M., Chervyakov N. et al., International Journal of Approximate Reasoning 2018 No. 102 P. 60–73
Cloud security issues are important factors for data storage and processing. Apart from the existing security and reliability problems of traditional distributed computing, there are new security and reliability problems. They include attacks on a virtual machine, attacks on the synchronization keys, and so on. According to the assessment of international experts in the field ...
Added: August 10, 2018
Ivanov F., Проблемы передачи информации 2017 Т. 53 № 3 С. 30–43
We propose a new ensemble of binary low-density parity-check codes with paritycheck matrices based on repetition codes and permutation matrices. The proposed class of codes is a subensemble of quasi-cyclic codes. For the constructed ensemble, we obtain minimum distance estimates. We present simulation results for the proposed code constructions under the (Sum-Product) iterative decoding algorithm ...
Added: February 1, 2018
Zyablov V., Rybin P., Problems of Information Transmission 2009 Vol. 45 No. 3 P. 204–220
We generalize the method for computing the number of errors correctable by a low-density parity-check (LDPC) code in a binary symmetric channel, which was proposed by V.V. Zyablov and M.S. Pinsker in 1975. This method is for the first time applied for computing the fraction of guaranteed correctable erasures for an LDPC code with a ...
Added: December 11, 2017
Zyablov V., Rybin P., Problems of Information Transmission 2012 Vol. 48 No. 4 P. 297–323
A new method for estimating the number of errors guaranteed to be corrected by a low-density parity-check code is proposed. The method is obtained by analyzing edges with special properties of an appropriate Tanner graph. In this paper we consider binary LDPC codes with constituent single-parity-check and Hamming codes and an iterative decoding algorithm. Numerical ...
Added: December 11, 2017
Rybin P., Zyablov V., Problems of Information Transmission 2015 Vol. 51 No. 3 P. 205–216
Two ensembles of low-density parity-check (LDPC) codes with low-complexity decoding algorithms are considered. The first ensemble consists of generalized LDPC codes, and the second consists of concatenated codes with an outer LDPC code. Error exponent lower bounds for these ensembles under the corresponding low-complexity decoding algorithms are compared. A modification of the decoding algorithm of ...
Added: December 11, 2017
Subbotin A., Osipov D., , in: Multiple Access Communications. 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings.: Cham: Springer, 2016. P. 15–29.
In what follows a coded DHA FH OFDMA employing robust reception and concatenated coding construction is considered. The problem of employing Generalized Minimum Distance decoder as an outer code decoder is considered. The effectiveness of the proposed decision is verified by means of simulation. In particular performance of the communication system under intensive mixed interference ...
Added: January 4, 2017