Abstract
Recently, Parizi, Telatar, and Merhav [1] determined the exact random coding secrecy exponents for a wiretap channel. In this study, we focus on the computation of such secrecy exponents. To obtain the exact random coding secrecy exponent for a constant composition random coding ensemble, optimization with respect to two stochastic matrices must be performed. Parizi et al. suggested that inner optimization is a convex optimization problem and therefore can be solved efficiently and that the outer optimization is not guaranteed to have convex structure and is solved by an exhaustive search. In this paper, we develop an efficient computation of the exact random coding secrecy exponent.
| Original language | English |
|---|---|
| Title of host publication | 2017 IEEE International Symposium on Information Theory, ISIT 2017 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1713-1717 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781509040964 |
| DOIs | |
| Publication status | Published - Aug 9 2017 |
| Event | 2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: Jun 25 2017 → Jun 30 2017 |
Other
| Other | 2017 IEEE International Symposium on Information Theory, ISIT 2017 |
|---|---|
| Country | Germany |
| City | Aachen |
| Period | 6/25/17 → 6/30/17 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics
Cite this
Jitsumatsu, Y. (2017). Computation of the random coding secrecy exponent for a constant composition ensemble. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 1713-1717). [8006822] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006822