General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel

@article{Hayashi2006GeneralNA,
  title={General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel},
  author={M. Hayashi},
  journal={IEEE Transactions on Information Theory},
  year={2006},
  volume={52},
  pages={1562-1575}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 21 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 188 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
109 Citations
18 References
Similar Papers

Citations

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

189 Citations

0102030'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 189 citations based on the available data.

See our FAQ for additional information.

References

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

Average error probability of identification via channels at rates above identification capacity

  • Proc. IEEE Int. Symp. Information Theory and Its…
  • 2002
Highly Influential
7 Excerpts

Error probability of identification via channels at rates above capacity

  • Y. Oohama
  • Proc. IEEE Int. Symp. Information Theory…
  • 2002
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…