?
Lower bounds on almost-separating binary codes
P. 1–6.
Moreira J., Fernández M., Kabatiansky G. A.
Separating codes have been used in many areas as diverse as automata synthesis, technical diagnosis and traitor tracing schemes. In this paper, we study a weak version of separating codes called almost separating codes. More precisely, we derive lower bounds on the rate of almost separating codes. From the main result it is seen that the lower bounds on the rate for almost separating codes are greater than the currently known lower bounds for ordinary separating codes. Moreover, we also show how almost separating codes can be used to construct a family of fingerprinting codes.
Kuvshinov A., Fominykh A., Ivanov F., IEEE Access 2026 Vol. 14 P. 50549–50557
The recursive (U|U+V) construction, a generalization of which includes polar codes, provides a powerful framework for building complex codes from simpler components. However, existing approaches predominantly rely on fixed or symmetric tree architectures, overlooking the critical impact of decomposition choice on code performance. This paper addresses the challenge of optimal tree decomposition selection by presenting a framework ...
Added: April 7, 2026
Логвиненко Т. И., Стрельцова А. В., Otstavnov N. et al., Вопросы образования 2025 № 2 С. 101–141
The aim of this article is to review empirical studies, meta-analyses and systematicreviews on educational interventions for developing and improving reading compre-hension in adolescents, including both typically developing readers and those ex-periencing reading difficulties. We distinguish seven intervention types aimed at im-proving reading comprehension, each targeting different components as the basisfor intervention: decoding and reading ...
Added: December 11, 2025
Khodadoust J., Monroy R., Marasco E., IEEE Transactions on Biometrics, Behavior, and Identity Science 2025 Vol. 7 No. 4 P. 668–680
Contactless fingerprint identification is gaining prominence due to its convenience, accessibility, security, and hygiene benefits over traditional contact-based methods. However, achieving accurate identification and efficiently searching large-scale databases remain challenging. In this paper, we introduce CFinSegNet, an encoder-decoder network for fingerprint segmentation that operates on preprocessed fingerprints and multiple image representations from diverse color spaces ...
Added: December 2, 2025
Kuvshinov A., Timokhin I., Ivanov F., , in: 2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Novosibirsk: IEEE, 2024. P. 52–57.
Concatenated codes are currently being actively investigated for the next-generation wireless communication sys tems due to their flexibility and ability to be used in various scenarios. The serial type of concatenation provides good error correcting properties with a potential reduction in complexity when an iterative concatenated decoder is used at the receiver side. One of ...
Added: November 16, 2024
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
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
Bugerya A. B., Kulagin I., Padaryan V. et al., , in: 2019 Ivannikov Memorial Workshop (IVMEM).: Velikiy Novgorod: [б.и.], 2019. P. 57–63.
One of the tasks of binary code security analysis is detection of undocumented features in software. This task is hard to automate, and it requires participation of a cybersecurity expert. The way of representation of the algorithm under analysis strongly determines the analysis effort and quality of its results. Existing intermediate representations and languages are ...
Added: October 14, 2023
Никольская Т. Е., Павлина С. Ю., Вестник Волгоградского государственного университета. Серия 2: Языкознание 2019 Т. 18 № 1 С. 132–145
The article investigates inter-cultural artistic communication which occurs through multimodal texts in general and feature films in particular. Artistic communication faces a challenge when its source and target belong to different ethnic and/or generational cohorts. The similarity or difference of communication codes depends on the level of adequacy of the sender’s and the recipient’s discursive ...
Added: September 19, 2023
Sergei Valentinovich Fedorenko, IEEE Access 2023 Vol. 11 P. 62771–62779
The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT. The direct DFT computational complexity has been reduced due to using the binary trace function over the finite field and ...
Added: July 19, 2023
Kurmukova A., Ivanov F., Zyablov V. V., Problems of Information Transmission 2022 Vol. 58 No. 2 P. 122–136
We propose a new approach to the analytical estimation of the error burst probability, the probability of erroneous decoding, and the probability of error per bit for convolutional codes with Viterbi decoding in a binary symmetric channel (BSC). Upper and lower estimates of the probability of error per bit and of the erroneous decoding probability ...
Added: November 19, 2022
A. M. Veresova, A. A. Ovchinnikov, , in: 2020 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2020. P. 1–4.
The main concepts of the metric description of memory channels are considered, as well as a specific metric for
such channels. The spectral properties of the Gilbert code in relation to the Markov metric are analyzed. It is shown that using a matched metric increases the efficiency of channel usage. ...
Added: October 30, 2022
A. M. Veresova, A. A. Ovchinnikov, , 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–4.
Channels with memory can be described using the Gilbert–Elliott model. To correct errors in such channels, non–
binary Reed-Solomon codes are used, as well as low-density parity-check codes together with interleaving procedure or modifications of classical decoding algorithms. The purpose of this study is to compare the effectiveness of these codes when using different decoding algorithms in channels with memory. The probability ...
Added: October 27, 2022
Fedorenko Sergei Valentinovich, IEEE Access 2022 Vol. 10 P. 110639–110645
A novel method of spectral decoding for systematic BCH codes has been proposed. This method has a simple description and a small computational complexity. ...
Added: October 26, 2022
Osipov D., , in: 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).: IEEE, 2021. P. 11–16.
Coded DHA FH OFDMA communication systems that use order statistics-based detectors are promising candidates for applications such as IoT and M2M. For the majority of order statistics-based reception techniques the high throughput coded modulation schemes development remains an open problem. In what follows a novel order-statistics based detector that outperforms the classical Maximum Rank Sum ...
Added: February 9, 2022
Nesterenko A., , in: 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).: IEEE, 2021. P. 39–44.
A description of an authenticated encryption with associated data (AEAD) block cypher mode, called XTSMAC, is presented. The results of the cryptanalysis, including the non-applicability of a new attack, based on differential properties of non-linear permutations, is also presented. The comparison with other AEAD modes and the results of practical software implementation on Intel’s CPU ...
Added: February 2, 2022
Sergei Valentinovich Fedorenko, IEEE Access 2021 Vol. 9 P. 38673–38686
A novel method for finding roots of polynomials over finite fields has been proposed.
This method is based on the cyclotomic discrete Fourier transform algorithm.
The improvement is achieved by using the normalized cyclic convolutions,
which have a small complexity and allow matrix decomposition,
as well as methods of adapting the truncated normalized cyclic convolutions calculation.
For small values of ...
Added: April 15, 2021
Okorokova L., Goodman J. M., Hatsopoulos N. G. et al., Journal of Neural Engineering 2020 Vol. 17 No. 4
Objective. The hand—a complex effector comprising dozens of degrees of freedom of movement—endows us with the ability to flexibly, precisely, and effortlessly interact with objects. The neural signals associated with dexterous hand movements in primary motor cortex (M1) and somatosensory cortex (SC) have received comparatively less attention than have those associated with proximal upper limb ...
Added: December 18, 2020
Ivanov F., Krouk E., Kabatiansky G. A. et al., Lecture Notes in Computer Science 2020 Vol. 12087 P. 41–49
Unlike most papers devoted to improvements of code-based cryptosystem, where original Goppa codes are substituted by some other codes, we suggest a new method of strengthening which is code-independent. We show (up to some limit) that the security of the new code-based cryptosystem is much closer to the hardness of maximum likelihood decoding than in the ...
Added: September 17, 2020
Makarov D., Yashunsky A., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2019 Vol. 13 No. 2 P. 280–289
We consider the two-dimensional generalizations of de Bruijn sequences; i.e., the integer-valued arrays whose all fragments of a fixed size (windows) are different. For these arrays, dubbed sub-de Bruijn, we consider the complexity of decoding; i.e., the determination of a position of a window with given content in an array. We propose a construction of ...
Added: September 9, 2020
Meniailo V. V., Interlitteraria 2020 Vol. 25 No. 1 P. 16–25
The theory of foregrounding, developed by St. Petersburg scholar
Irina Vladimirovna Arnold in the middle of the 20th century, was rather
revolutionary for its time as it aimed to establish connection between
formal levels of the language and textual meanings that allowed the
reader to decode the author’s message. Arnold identifies four principal
elements of foregrounding that disclose conceptual textual ...
Added: July 9, 2020
Ivanov F., Krouk E., Kreshchuk A., , in: 2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).: IEEE, 2019. P. 133–138.
Added: March 17, 2020
Fedorenko Sergei Valentinovich, IEEE Signal Processing Letters 2019 Vol. 26 No. 9 P. 1320–1324
An effective calculation of the Reed-Solomon code syndrome is proposed. The method is based on the use of the partial normalized cyclic convolutions in the partial inverse cyclotomic discrete Fourier transform. The method is the best of the known algorithms, in terms of multiplicative complexity. ...
Added: September 4, 2019
Kreps V. L., Gavrilovich M., Математическая теория игр и ее приложения 2019 Т. 11 № 1 С. 21–38
Matrix games with incomplete information on both sides and public signal on the state of game represented by random binary code of fixed length are considered. Players are computationally bounded and are only able to play strategies to finite automata of different sizes: m for Player 1 and n for Player 2 where m ≫ ...
Added: May 31, 2019