Refined Strong Converse for the Constant Composition Codes


Cheng H., Nakiboğlu B.

2020 IEEE International Symposium on Information Theory, ISIT 2020, California, United States Of America, 21 - 26 July 2020, pp.2149-2154 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • Doi Number: 10.1109/isit44484.2020.9174315
  • City: California
  • Country: United States Of America
  • Page Numbers: pp.2149-2154

Abstract

A strong converse bound for constant composition codes of the form P-e((n)) >= 1 - An(-0.5)(1-E-sc'(R, W, P))(e) - nE(sc)(R, W, P) is established using the Berry-Esseen theorem through the concepts of Augustin information and Augustin mean, where A is a constant determined by the channel W, the composition p, and the rate R, i.e., A does not depend on the block length n.