The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
From MaRDI portal
Publication:5594949
Cites work
- scientific article; zbMATH DE number 3167427 (Why is no real title available?)
- Beitr�ge zur Shannonschen Informationstheorie im Falle nichtstation�rer Kan�le
- Certain results in coding theory for noisy channels
- Channels with arbitrarily varying channel probability functions
- Coding for a class of unknown channels
- Correlated decoding for channels with arbitrarily varying channel probability functions
- The coding of messages subject to chance errors
Cited in
(13)- Asymptotics of input-constrained binary symmetric channel capacity
- Elimination of correlation in random codes for arbitrarily varying channels
- Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
- The capacities of certain special channels with arbitrarily varying channel probability functions
- The total capacity of two-user multiple-access channel with binary output
- Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback
- Capacity of the Gaussian arbitrarily varying channel
- $\epsilon$-Capacity of Binary Symmetric Averaged Channels
- Capacity results for arbitrarily varying wiretap channels
- On the capacity of the arbitrarily varying channel for maximum probability of error
- On the method of types and approximation of output measures for channels with infinite alphabets
- Message transmission over classical quantum channels with a jammer with side information: correlation as resource, common randomness generation
- Arbitrarily varying channels with general alphabets and states
This page was built for publication: The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5594949)
