Title :
Two proofs of Pinsker´s conjecture concerning arbitrarily varying channels
Author :
Ahlswede, Rudolf ; Cai, Ning
Author_Institution :
Fakultat fuer Math., Bielefeld Univ., Germany
fDate :
11/1/1991 12:00:00 AM
Abstract :
M.S. Pinsker (1990) conjectured the following theorem: for an arbitrary varying channel (AVC), every rate below the random code capacity is achievable with deterministic list codes of constant list size, if the average error criterion is used. Two proofs of this theorem are given
Keywords :
encoding; telecommunication channels; Pinsker´s conjecture; arbitrarily varying channels; average error criterion; constant list size; deterministic list codes; random code capacity; Automatic voltage control; Binary sequences; Codes; Conferences; Data compression; Entropy; Error probability; Information theory; Source coding; Stochastic processes;
Journal_Title :
Information Theory, IEEE Transactions on
