Saddle Point in the Minimax Converse for Channel Coding

@article{Polyanskiy2013SaddlePI,
  title={Saddle Point in the Minimax Converse for Channel Coding},
  author={Yury Polyanskiy},
  journal={IEEE Transactions on Information Theory},
  year={2013},
  volume={59},
  pages={2576-2595}
}
A minimax metaconverse has recently been proposed as a simultaneous generalization of a number of classical results and a tool for the nonasymptotic analysis. In this paper, it is shown that the order of optimizing the input and output distributions can be interchanged without affecting the bound. In the course of the proof, a number of auxiliary results of separate interest are obtained. In particular, it is shown that the optimization problem is convex and can be solved in many cases by the… CONTINUE READING
Highly Cited
This paper has 74 citations. REVIEW CITATIONS
44 Citations
28 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

74 Citations

01020'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Minimax theorems

  • K. Fan
  • Proc. Nat. Acad. Sci., vol. 39, pp. 42–47, 1953.
  • 1953
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…