On the capacity of channels with unknown interference
From MaRDI portal
Recommendations
- Information Capacity of Channels with Partially Unknown Noise. I. Finite-Dimensional Channels
- scientific article; zbMATH DE number 3924669
- A complete characterization of minimax and maximin encoder- decoder policies for communication channels with incomplete statistical description
- Some Information Theoretic Saddlepoints
- Communication games with partially soft power constraints
Cited in
(14)- Communication games with partially soft power constraints
- Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
- On communication over Gaussian sensor networks with adversaries: further results
- scientific article; zbMATH DE number 3861049 (Why is no real title available?)
- An eavesdropping game with SINR as an objective function
- A complete characterization of minimax and maximin encoder- decoder policies for communication channels with incomplete statistical description
- scientific article; zbMATH DE number 3924669 (Why is no real title available?)
- Some Information Theoretic Saddlepoints
- The noncooperative binary adder channel
- Capacity Limits for Binary Codes in the Presence of Interference
- Error bounds for the Euclidean channel subject to intentional jamming
- Information Capacity of Channels with Partially Unknown Noise. I. Finite-Dimensional Channels
- A note on the solution of a communication jamming problem of root
- Two-Way Interference Channel Capacity: How to Have the Cake and Eat It Too
This page was built for publication: On the capacity of channels with unknown interference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735126)
