Sign in

Efficiently Computable Converses for Finite-Blocklength Communication.

Felipe ArecesDan SongRichard D. WeselAaron B. Wagner
Published in: ISIT (2022)
Keyphrases
  • efficiently computable
  • sufficient conditions
  • upper bound
  • computationally hard
  • lower bound
  • computational complexity
  • probability distribution