Title :
An upper bound on the zero-error list-coding capacity
Author_Institution :
Dept. of Electr. Eng., Bilkent Univ., Ankara, Turkey
fDate :
7/1/1994 12:00:00 AM
Abstract :
Presents an upper bound on the zero-error list-coding capacity of discrete memoryless channels. Using this bound, we show that the list-3 capacity of the 4/3 channel is at most 0.3512 bits, improving the best previous bound. The relation of the bound to earlier similar bounds, in particular, to Korner´s (1986) graph-entropy bound, is discussed
Keywords :
encoding; entropy; file organisation; graph theory; information theory; list processing; telecommunication channels; 0.3512 bit; 4/3 channel; Shannon capacity; discrete memoryless channels; graph-entropy bound; list coding; list-3 capacity; perfect hashing; upper bound; zero-error capacity; Block codes; Conferences; Entropy; Memoryless systems; Mutual information; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
