New Converse Bounds for Discrete Memoryless Channels in the Finite Blocklength Regime
Yasutada Oohama

TL;DR
This paper derives explicit bounds on the capacity of discrete memoryless channels in the finite blocklength regime, utilizing the information spectrum approach to improve understanding of channel limits.
Contribution
It introduces new explicit lower and upper bounds for channel capacity in the finite blocklength regime using the information spectrum method.
Findings
Derived explicit capacity bounds for finite blocklength DMCs
Demonstrated the effectiveness of the information spectrum approach
Provided insights into the limits of channel coding in finite regimes
Abstract
We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cellular Automata and Applications · Chaos-based Image/Signal Encryption
