"Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian ..."

Holger Boche et al. (2025)

> Home

Details and statistics

DOI: 10.1109/ISIT63088.2025.11195571

access: closed

type: Conference or Workshop Paper

metadata version: 2025-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/BocheGSP25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/BocheGSP25
Holger Boche, Andrea Grigorescu, Rafael F. Schaefer, H. Vincent Poor:
Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels. ISIT 2025: 1-6

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.