Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
| Hi-index | 754.84 |
Several nonasymptotic formulas are established in channel resolvability and identification capacity, and they are applied to the wiretap channel. By using these formulas, the epsi capacities of the above three problems are considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. As a result, we solve an open problem proposed by Han and Verduacute. Moreover, we obtain lower bounds of the exponents of error probability and the wiretapper's information in the wiretap channel