The Prospects of Optimization Theory Application for Solving Shannon Problem

Abstract

The results of the Optimization Theory (OT) of error-correcton coding obtained over 50 years are considered. It is shown that OT completely solved the Shannon's problem for all classical channels. It is indicated that OT algorithms provide the best possible characteristics. It is noted that the united criterion for the quality of algorithms <> ≡ “noiseproofness-veracity-complexity” is satisfied only by decoders created within the framework of OT, which have the best theoretically possible characteristics. The simplest practically optimal decoders OT are built on the basis of the theories of the search for global extremums of functionals. Our block Viterbi algorithms also have minimal complexity.