Secure identification for multi-antenna Gaussian channels
From MaRDI portal
Cites work
- A Mathematical Theory of Communication
- Broadcast channels with confidential messages
- Explicit construction of optimal constant-weight codes for identification via channels
- Fundamentals of Wireless Communication
- Identification and Other Probabilistic Models
- Identification in the presence of feedback-a discovery of new capacity formulas
- Identification in the presence of side information with application to watermarking
- Identification over additive noise channels in the presence of feedback
- Identification via channels
- New directions in the theory of identification via channels
- New results in the theory of identification via channels
- On the method of types and approximation of output measures for channels with infinite alphabets
- Resource allocation in multiantenna systems-achieving max-min fairness by optimizing a sum of inverse SIR
- Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers
- Secrecy results for compound wiretap channels
- Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs
- The Wire-Tap Channel
- The role of information theory in watermarking and its application to image watermarking.
- Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder
- Watermarking Identification Codes with Related Topics on Common Randomness
This page was built for publication: Secure identification for multi-antenna Gaussian channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6973068)
