Dear colleagues! Finally, after a long period of preliminary preparation, we are very pleased to inform you that our scientific school in Optimization Theory (OT) of error-correcting coding has prepared in e-format its new complete monograph «Coding Theory as a Simple Optimal Decoding near Shannon’s Bound» in English.<\/p>\n
This monograph describes the methods of the simplest implementation of decoding algorithms with the minimum possible, proportional to the length of the codes, the decoding complexity. And at the same time, the reliability of a such decoding, which we call multithreshold (MTD), almost always corresponds to the optimal decision, the most plausible, which is usually achieved on the basis of a complete (total) searching among all possible messages, the number of which grows exponentially with the increase of the code length. The best known such optimal decoder (OD) is the Viterbi algorithm (VA) for short convolutional codes. But you can easy find a new block Viterbi algorithm (BVA) in our book also.<\/p>\n
Our MTD algorithms with linear complexity at the code length easily implement the full corrective capabilities of the used long codes, which allow them to work successfully in the immediate vicinity of the Shannon’s bound.<\/p>\n
It is clear that the capacity of classical channels with independent additive errors is always absolutely elastic and, consequently, unattainable, as well as the speed of light for material bodies. Because of this, there is always a certain interval between the Shannon’s bound and the boundary of the working areas of MTD algorithms, which by the efforts of the supporters of our scientific school has gradually decreased during all previous years. This is a payment for linearly growing with the code length in the complexity of MTD algorithms instead of its exponential growth. For a large number of code systems we have already considered, this interval has already become quite small. We are confident that it can be else further reduced to some extent in the future.<\/p>\n
Our MTD algorithms on the complex criterion of noise immunity-reliability-complexity have no competitors among other methods of error correction in the classical channels considered in the coding theory. This allows us to believe that OT has become a new «quantum mechanics» of information theory. Algebraic theory was the youth of coding theory. Now the prolonged transition of leadership in the application of coding theory have ended to our OT. It implements methods of searching global extremum of functional (SGEF) and provides a very simple decoding with the OD effectiveness. OT is largely a new philosophical and methodological system with an extremely simple mathematical description. Its success is determined by the correct ratio of fine theoretical studies and powerful technological methods in the field of modeling and optimization of complex functions, which allowed our school to take a leading place in the research of the new theory of coding. Dear colleagues, you have the opportunity to check the fairness of our opinion.<\/p>\n
We believe that methods and technologies OT have created vast opportunities for the rapid development of methods to maintain the high reliability of information for our digital information civilization.<\/p>\n
You can rewrite our new book by following the link https:\/\/decoders-zolotarev.ru\/en\/wp-content\/uploads\/2020\/11\/mtd_book_2019.pdf<\/a> \u00a0from our web-site https:\/\/decoders-zolotarev.ru\/en\/<\/a> We very much hope that the novelty of our research and the resulting understandable inaccuracies of translation will not prevent you from understanding the deep essence of the new theory and its computer technologies presented to you.<\/p>\n \n Scientific school<\/p>\n Optimization Theory (OT) of error-correction coding<\/p>\n","protected":false},"excerpt":{"rendered":" Dear colleagues! Finally, after a long period of preliminary preparation, we are very pleased to inform you that our scientific school in Optimization Theory (OT) of error-correcting coding has prepared in e-format its new complete monograph «Coding Theory as a Simple Optimal Decoding near Shannon’s Bound» in English. This monograph describes the methods of the […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"yoast_head":"\n\n\n\n\n\n\n\n\n\n\n\n\t\n