2018
DOI: 10.48550/arxiv.1811.00262
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Semi-Finite Length Analysis for Information Theoretic Tasks

Masahito Hayashi

Abstract: We focus on the optimal value for various information-theoretical tasks. There are several studies for the asymptotic expansion for these optimal values up to the order √ n or log n. However, these expansions have errors of the order o( √ n) or o(log n), which does not goes to zero asymptotically. To resolve this problem, we derive the asymptotic expansion up to the constant order for upper and lower bounds of these optimal values. While the expansions of upper and lower bonds do not match, they clarify the ra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 36 publications
0
1
0
Order By: Relevance
“…Unfortunately, this paper discusses only the asymptotic performance. Since the implemented communication system has finite-length codes, we need to evaluate the security of finite-length codes for its practical application [36], [37], [38], [39], [40]. Since the finite-length analysis depends on the choice of the security criterion, we need to be careful of its choice [7], [10].…”
mentioning
confidence: 99%
“…Unfortunately, this paper discusses only the asymptotic performance. Since the implemented communication system has finite-length codes, we need to evaluate the security of finite-length codes for its practical application [36], [37], [38], [39], [40]. Since the finite-length analysis depends on the choice of the security criterion, we need to be careful of its choice [7], [10].…”
mentioning
confidence: 99%