Abstract:
A general definition of noiseless channels and of the corresponding codes is investigated. Various possible definitions of the channel capacity and the advisability of using these definitions to solve the coding problem with minimum cost are evaluated. The general results are clarified by using the example of channels with a finite number of states and, in particular, memoryless channels.