DocumentCode
850506
Title
Two proofs of Pinsker´s conjecture concerning arbitrarily varying channels
Author
Ahlswede, Rudolf ; Cai, Ning
Author_Institution
Fakultat fuer Math., Bielefeld Univ., Germany
Volume
37
Issue
6
fYear
1991
fDate
11/1/1991 12:00:00 AM
Firstpage
1647
Lastpage
1649
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.104326
Filename
104326
Link To Document