2020
DOI: 10.1007/978-3-030-51974-2_38
|View full text |Cite
|
Sign up to set email alerts
|

Application of Correcting Polynomial Modular Codes in Infotelecommunication Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…It is generally accepted that of the known methods of encoding information in problems of ensuring high noise immunity (Reed-Muller, cyclic redundancy check (CRC), (Bose-Chowdhury-Hockingham (BCH), etc. ), the code in the deduction system (the system of residual classes, RNS, built on the basis of the Chinese remainder theorem) and the Reed-Solomon code have the greatest appeal [12][13][14]. These codes are used with high efficiency in high-speed, digital signal processing algorithms with a large amount of computational operations, but the RNS is most organically combined with a neural network basis [15].…”
Section: Introductionmentioning
confidence: 99%
“…It is generally accepted that of the known methods of encoding information in problems of ensuring high noise immunity (Reed-Muller, cyclic redundancy check (CRC), (Bose-Chowdhury-Hockingham (BCH), etc. ), the code in the deduction system (the system of residual classes, RNS, built on the basis of the Chinese remainder theorem) and the Reed-Solomon code have the greatest appeal [12][13][14]. These codes are used with high efficiency in high-speed, digital signal processing algorithms with a large amount of computational operations, but the RNS is most organically combined with a neural network basis [15].…”
Section: Introductionmentioning
confidence: 99%