On the Prospects of Optimization Theory

Abstract

the situation resulted from the solution of Shannon problem by optimization theory of error-correcting coding in the applied studies of coding theory is analyzed. Unresolved problems of classical (algebraic) theory are discussed. The results for main clusters of decoding algorithms built on the basis of Optimization Theory (OT) are considered. Further tasks for OT development are given, the methods for their solution are offered. Broad possibilities shown by new versions of Viterbi algorithm are mentioned. Advantages of main OT paradigms including the advantages of symbolic codes and divergent coding are shown. A special group of decoding algorithms with direct metrics control (DDMC) is singled out. The main ways to develop coding theory for the coming years and for the future are listed.