Please use this identifier to cite or link to this item:
https://dspace.ncfu.ru/handle/123456789/32426| Title: | Development of an Algorithm for Finding Errors in Modular Codes |
| Authors: | Lidzhiev, A. B. Лиджиев, А. Б. Peleshenko, V. S. Пелешенко, В. С. Peleshenko, T. A. Пелешенко, Т. А. Gish, A. S. Гиш, А. С. |
| Keywords: | Allowed combination;Modular code;Orthogonal basis;Residue number system (RNS);Single error |
| Issue Date: | 2026 |
| Publisher: | Springer Science and Business Media Deutschland GmbH |
| Citation: | Lidzhiev, A. B., Peleshenko, V. S., Peleshenko, T. A., Gish, A. S., Athavale, V. A. Development of an Algorithm for Finding Errors in Modular Codes // Lecture Notes in Networks and Systems. - 2026. - 1456 LNNS. - pp. 298 - 309. - DOI: 10.1007/978-3-032-07275-7_28 |
| Series/Report no.: | Lecture Notes in Networks and Systems |
| Abstract: | The purpose of the scientific work is to develop a software implementation, to study the algorithm for finding errors in modular codes (MC) and their detection by introducing two redundant moduli. The study focuses on the characteristics of errors that occur in the codes of the residue number system (RNS), without the direct purpose of detecting them. To conduct the study, an approach based on the calculation of all entered allowed combinations of the code of the RNS was taken as a basis, followed by obtaining intervals without taking into account rank. To achieve this goal, a program code in the C++ language was developed, which includes a menu with functions for searching for a single error in modular codes. The presented approach and software implementation can be useful to specialists in the field of information systems of transmission and signal processing in the analysis and correction of errors in modular codes. |
| URI: | https://dspace.ncfu.ru/handle/123456789/32426 |
| Appears in Collections: | Статьи, проиндексированные в SCOPUS, WOS |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| scopusresults 3822.pdf Restricted Access | 130.41 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.