NOISE IMMUNITY OF THE ALGEBRAIC GEOMETRIC CODES
| Autor: | Oleksii Smirnov, Alexandr Kuznetsov, Ievgeniia Kolovanova, Tetiana Kuznetsova |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Computational complexity theory
Noise immunity Computer Networks and Communications Computer science 020208 electrical & electronic engineering 020206 networking & telecommunications 02 engineering and technology Algebraic geometric Hardware and Architecture 0202 electrical engineering electronic engineering information engineering Computer Science (miscellaneous) Algebraic curve Algorithm Software Decoding methods Information Systems Coding (social sciences) Efficient energy use Data transmission |
| Zdroj: | Scopus-Elsevier |
| ISSN: | 2312-5381 1727-6209 |
| Popis: | Linear block noise-immune codes constructed according to algebraic curves (algebraic geometric codes) are considered, their design properties are evaluated, algorithms of construction and decoding are studied. The energy efficiency of the transmission of discrete messages by M-ary orthogonal signals in the application of algebraic geometric codes is studied; the achievable energy gain from the use of noise-immune coding is estimated. The article shows that in discrete channels without memory it is possible to obtain a significant energy gain, which increases with the transition to long algebraic geometric codes constructed from curves with a large number of points relative to the genus of the curve. It is found that the computational complexity of implementing algebraic geometric codes is comparable to other known noise-immune codes, for example, Reed-Solomon codes and others. Thus, high energy efficiency in combination with the acceptable computational complexity of implementation confirms the prospects of algebraic geometric codes use in modern telecommunication systems and networks to improve the noise immunity of data transmission channels. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|