2021•arXiv (Cornell University)Open access

Non-Asymptotic Converse Bounds Via Auxiliary Channels

Ioannis Papoutsidakis, Robert J. Piechocki, Angela Doufexi

Open full text 0 citations

Abstract

This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an auxiliary channel the converse bound is produced. This method is general and initially is presented for an arbitrary weakly symmetric channel. Afterwards, the main result is specialized for the $q$-ary erasure channel (QEC), binary symmetric channel (BSC), and QEC with stop feedback. Numerical evaluations show identical or comparable bounds to the state-of-the-art in the cases of QEC and BSC, and a tighter bound for the QEC with stop feedback.

Open-access reader

About this research paper

What this paper is about

This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an auxiliary channel the converse bound is produced. This method is general and initially is presented for an arbitrary weakly symmetric channel. Afterwards, the main result is specialized for the $q$-ary erasure channel (QEC), binary symmetric channel (BSC), and QEC with stop feedback. Numerical evaluations show identical or comparable bounds to the state-of-the-art in the cases of QEC and BSC, and a tighter bound for the QEC with stop feedback.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an auxiliary channel the converse bound is produced. This method is general and initially is presented for an arbitrary weakly symmetric channel. Afterwards, the main result is specialized for the $q$-ary erasure channel (QEC), binary symmetric channel (BSC), and QEC with stop feedback. Numerical evaluations show identical or comparable bounds to the state-of-the-art in the cases of QEC and BSC, and a tighter bound for the QEC with stop feedback.

Key concepts: Converse, Binary erasure channel, Channel (broadcasting), Erasure, Mathematics, Binary number, Converse theorem, Topology (electrical circuits)

Related papers

Back to paper searchBrowse research topicsOriginal source
Non-Asymptotic Converse Bounds Via Auxiliary Channels — Research Paper | ScholarLens