?
Soft-decision list decoding of Reed-Muller codes with linear complexity
P. 2303–2307.
Dumer I., Kabatiansky G. A., Tavernier C.
In book
СПб.: [б.и.], 2011.
Логвиненко Т. И., Стрельцова А. В., 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
Lazarevich I., Prokin I., Гуткин Б. С. et al., PLoS Computational Biology 2023 Vol. 19 No. 1 P. 1–18
Modern well-performing approaches to neural decoding are based on machine learning
models such as decision tree ensembles and deep neural networks. The wide range of algorithms
that can be utilized to learn from neural spike trains, which are essentially time-series
data, results in the need for diverse and challenging benchmarks for neural decoding, similar
to the ones in the ...
Added: March 18, 2024
Aksiotis V., Ossadtchi A., В кн.: Сборник тезисов XXIV съезда физиологического общества им. И. П. Павлова, 11–15 сентября 2023 года.: СПб.: ООО "Издательство ВВМ", 2023. С. 307–307.
Несмотря на последние достижения (Fajardo et al., 2020; Okorokova et al., 2015), создание систем, сочетающих распознавание по электромиографической активности естественных намерений к движению отдельными пальцами или сложными жестами остается проблемой (Pasluosta et al., 2022). Актуальной является задача создания систем обучения пациентов управлению протезом на ранних этапах ампутации. Исследование включает разработку системы бесконтактного сбора синхронной кинематики ...
Added: December 1, 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
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
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
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
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
Ivanov F., Zhilin I., Automation and Remote Control 2016 Vol. 77 No. 10 P. 1781–1791
A modification of the decoding q-ary Sum Product Algorithm (q-SPA) was proposed for the nonbinary codes with small check density based on the permutation matrices. The algorithm described has a vector realization and operates over the vectors defined on the field GF(q), rather than over individual symbols. Under certain code parameters, this approach enables significant speedup of modeling. ...
Added: October 3, 2018
Fedorenko S., СПб.: ГУАП, 2008.
Fast algorithms for decoding of linear block codes. ...
Added: February 3, 2018
Sergei Valentinovich Fedorenko, IEEE Signal Processing Letters 2016 Vol. 23 No. 6 P. 824–827
A novel method for computing the discrete Fourier transform (DFT) over a finite field based on the Goertzel-Blahut algorithm is described. The novel method is currently the best one for computing the DFT over even extensions of the characteristic two finite field, in terms of multiplicative complexity. ...
Added: January 26, 2018
Ivanov F., Zhilin I., Автоматика и телемеханика 2016 Т. 10 С. 109–122
A modification of the decoding q-ary Sum Product Algorithm (q-SPA) was proposed for the nonbinary codes with small check density based on the permutation matrices. The algorithm described has a vector realization and operates over the vectors defined on the field GF(q), rather than over individual symbols. Under certain code parameters, this approach enables significant ...
Added: December 11, 2017
Krouk E., СПб.: ГУАП, 2007.
В монографии рассмотрены вопросы комбинаторного декодирования линейных кодов в дикретных каналах. Монография может быть использована студентами обучающимися по специальности 09.01.04 ...
Added: August 7, 2017
Zusman V., В кн.: Коммуникативистика XXI века: человек в современном мире коммуникаций: материалы VII Всероссийской научно-практической конференции 20 апреля 2011 г.: Н. Новгород: Издательство НИСОЦ, 2011. С. 59–63.
В статье рассматривается категория "смысл" и его возможное искажние при автоматическом переводе. ...
Added: November 10, 2012