Yaniv Akirav

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC's)), and various ensembles of random codes, are studied by combining the competitive minimax approach, proposed by Feder and Merhav, with Chernoff bound and Gallager's techniques for the analysis of error exponents. In(More)
  • 1