The Optimum Rate of Information Transmission Through Noiseless Channels, General Case
A noiseless channel is characterized by the set of messages the channel is capable to transmit and by the respective costs. Let Y denote the channel alphabet, let V be a subset of Y* , to be called the language of the channel (the set of messages directly transmissible by the channel), and let z(u) be a non-negative valued function on V such that u < ω implies z(u) < z(υ); here z(u) is interpreted as the cost of transmission of the sequence u∈V.
KeywordsInformation Transmission Channel Capacity Average Cost Code Word Incomplete Block
Unable to display preview. Download preview PDF.