Summary form only given, as follows. The authors consider the deterministic coding capacities of the following discrete arbitrarily varying channel (AVC) models with constraints on the channel states: (i) the binary adder channel, (ii) the arithmetic adder channel, and (iii) the multiplier channel. For cases (i) and (ii), the deterministic coding capacities equal the respective random coding capacities. For the multiplier channel in case (iii), the deterministic coding capacity, under suitable conditions, is shown to lie strictly between zero and the random coding capacity. The issue of random coding capacities of general discrete AVCs with codeword and state constraints is also addressed.
|Number of pages||1|
|Publication status||Published - dec. 1 1986|
ASJC Scopus subject areas