• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the Algorithmic Computability of Achievability and Converse: ϵ-Capacity of Compound Channels and Asymptotic Bounds of Error-Correcting Codes.

Holger BocheRafael F. SchaeferH. Vincent Poor
Published in: ISIT (2020)
Keyphrases
  • error correcting codes
  • worst case
  • error correcting
  • error correction
  • upper bound
  • minimum distance
  • lower bound
  • decoding algorithm
  • multi class
  • np complete