We welcome you to our dynamic portal for the optimization theory (OT) error-correcting coding and specific methods of multithreshold decoding (MTD), which has recently come a long way from interesting, but a bit exotic algorithms with good opportunities to the only methods of decoding with complexity of realization proportional to length of a code near Shannon’s bound. To this result we tried to come for many years and are proud to announce the scientific and technical community that in 50 years after our meeting with a wonderful book «Threshold decoding», James Massey and to the moment 70-year anniversary of the great article Claude Shannon’s «A Mathematical Theory of Communication» we have completely solved the problem a simple highly reliable decoding near the capacity for all main channels on the basis of majority decoding methods, which we call multithreshold decoders (MTD). They are really methods of searching functional global extremum in a specific discrete spaces.

 Easy of implementation of our methods is determined by the multithreshold decoders (MTD) complexity, with increasing length of the codes used growing only linearly, which is the theoretically least possible complexity, understood as the number operations of decoder. And when the hardware implementation of the MTD algorithms designed on the basis of our patents are, even theoretically, the fastest among all possible methods of error correction, including close to the bound of Shannon.

The development of technology decoding in the near future, and it is possible that in the far long time will be determined by the rate of expansion of the space of OT that has created many new paradigms that determine the vector of the most successful areas of growth theory and applied achievements. Divergent coding, the group of methods of direct control metrics (DDCM), including our patented block Viterbi algorithm (BVA) with twice deminished exponent of the complexity, variety improved the concatinated schemes – all these at the same time powerful and simple methods have replaced the decoders algebraic type for the block codes of all types in various channels with random errors and sequential algorithms also.

We are preparing a book on new and already known methods of decoding, which has the working title «The Coding Theory as a Problem of Searching Extremum of Functionals». It will reflect all of the major achievements of our scientific schools, which we will analyze with united opinion of the solving tasks of searching global functional extremum.

We will soon be ready to give our monograph for translation to the appropriate publisher.

And while we remind our readers that in addition to the many materials about OT and MTD algorithms now on the education page of the portal https://decoders-zolotarev.ru/en/ among the large volume of different types demoprograms you can find three new demo of MTD decoders, which allow adjustment more wide range of decoder paramiters, special place among which is the choice of the code polynomials for your experiments. It allows just at the first steps to any user of these new modeling software platforms to test independently the proposed algorithms of multithreshold type for binary, symbolic and regenerating erasure codes in order to promptly solve the issues of usage of MTD algorithms for the solution of their current problems.

As for previously prepared for viewing demoprograms all this three new modeling platforms are provided with descriptions and examples, explaining their work. This allows you to learn quickly the proposed means of advanced simulation and to do the first steps in the exploration of new MTD algorithms created on the basis of Optimization Theory.

We wish you success in learning «quantum mechanics» of the new coding theory!