A New Unified Method for Fixed-Length Source Coding Problems of General Sources
Summary :
This paper establishes a new unified method for fixed-length source coding problems of general sources. Specifically, we introduce an alternative definition of the smooth Renyi entropy of order zero, and show a unified approach to present the fixed-length coding rate in terms of this information quantity. Our definition of the smooth Renyi entropy has a clear operational meaning, and hence is easy to calculate for finite block lengths. Further, we represent various ε-source coding rate and the strong converse property for general sources in terms of the smooth Renyi entropy, and compare them with the results obtained by Han and Renner et al.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.11 pp.1868-1877
- Publication Date
- 2010/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.1868
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Source Coding
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tomohiko UYEMATSU, "A New Unified Method for Fixed-Length Source Coding Problems of General Sources" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 1868-1877, November 2010, doi: 10.1587/transfun.E93.A.1868.
Abstract: This paper establishes a new unified method for fixed-length source coding problems of general sources. Specifically, we introduce an alternative definition of the smooth Renyi entropy of order zero, and show a unified approach to present the fixed-length coding rate in terms of this information quantity. Our definition of the smooth Renyi entropy has a clear operational meaning, and hence is easy to calculate for finite block lengths. Further, we represent various ε-source coding rate and the strong converse property for general sources in terms of the smooth Renyi entropy, and compare them with the results obtained by Han and Renner et al.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1868/_p
Copy
@ARTICLE{e93-a_11_1868,
author={Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A New Unified Method for Fixed-Length Source Coding Problems of General Sources},
year={2010},
volume={E93-A},
number={11},
pages={1868-1877},
abstract={This paper establishes a new unified method for fixed-length source coding problems of general sources. Specifically, we introduce an alternative definition of the smooth Renyi entropy of order zero, and show a unified approach to present the fixed-length coding rate in terms of this information quantity. Our definition of the smooth Renyi entropy has a clear operational meaning, and hence is easy to calculate for finite block lengths. Further, we represent various ε-source coding rate and the strong converse property for general sources in terms of the smooth Renyi entropy, and compare them with the results obtained by Han and Renner et al.},
keywords={},
doi={10.1587/transfun.E93.A.1868},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - A New Unified Method for Fixed-Length Source Coding Problems of General Sources
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1868
EP - 1877
AU - Tomohiko UYEMATSU
PY - 2010
DO - 10.1587/transfun.E93.A.1868
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2010
AB - This paper establishes a new unified method for fixed-length source coding problems of general sources. Specifically, we introduce an alternative definition of the smooth Renyi entropy of order zero, and show a unified approach to present the fixed-length coding rate in terms of this information quantity. Our definition of the smooth Renyi entropy has a clear operational meaning, and hence is easy to calculate for finite block lengths. Further, we represent various ε-source coding rate and the strong converse property for general sources in terms of the smooth Renyi entropy, and compare them with the results obtained by Han and Renner et al.
ER -
English
