Title :
On the converse to the coding theorem for discrete memoryless channels (Corresp.)
fDate :
5/1/1973 12:00:00 AM
Abstract :
A new lower bound on the probability of decoding error for the case of rates above capacity is presented. It forms a natural companion to Gallager´s random coding bound for rates below capacity. The strong converse to the coding theorem follows immediately from the proposed lower bound.
Keywords :
Decoding; Memoryless channels; Capacity planning; Codes; Convergence; H infinity control; Information theory; Maximum likelihood decoding; Memoryless systems; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1973.1055007
