DocumentCode
3021965
Title
The AVC with noiseless feedback and maximal error probability: a capacity formula with a trichotomy
Author
Ahlswede, Rudolf ; Cai, Ning
Author_Institution
Fak. fur Math., Bielefeld Univ., Germany
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
132
Abstract
Summary form only given. To use common randomness in coding is a key idea from the theory of identification. Methods and ideas of this theory are shown here to have also an impact on Shannon´s theory of transmission. We determine the capacity for a classical arbitrarily varying channel (AVC) (Ahlswede, 1973) with a novel structure of the capacity formula. This channel models a robust search problem in the presence of noise (Ahlswede and Wegner 1987)
Keywords
channel capacity; channel coding; error statistics; feedback; information theory; noise; search problems; time-varying channels; AVC; Shannon´s theory; arbitrarily varying channel; capacity; classical channel; coding; common randomness; identification; maximal error probability; noise; noiseless feedback; search problem; transmission; trichotomy; Automatic voltage control; Capacity planning; Error probability; Feedback; Noise robustness; Search problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613047
Filename
613047
Link To Document