Pages that link to "Item:Q3987461"
From MaRDI portal
The following pages link to Two proofs of Pinsker's conjecture concerning arbitrarily varying channels (Q3987461):
Displaying 3 items.
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources (Q326306) (← links)
- Search with noisy and delayed response (Q3439235) (← links)
- Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true (Q4701326) (← links)