A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Capacity and decoding rules for classes of arbitrarily varying channels
IEEE Transactions on Information Theory
Ahstrucf -We consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error critenon and, typically, subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channels and group adder channels are studied in detail. For the former the capacity is explicitlydoi:10.1109/18.32153 fatcat:ajx4yxmzmngghgcziiczu7eoxy