IEICE TRANSACTIONS on Fundamentals
A Universal Data-Base for Data Compression
Summary :
A data-base for data compression is universal if in its construction no prior knowledge of the source distribution is assumed and is optimal if, when we encode the reference index of the data-base, its encoding rate achieves the optimal encoding rate for any given source: in the noiseless case the entropy rate and in the semifaithful case the rate-distortion function of the source. In the present paper, we construct a universal data-base for all stationary ergodic sources, and prove the optimality of the thus constructed data-base for two typical methods of referring to the data-base: one is a block-shift type reference and the other is a single-shift type reference.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E78-A No.9 pp.1057-1062
- Publication Date
- 1995/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
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
Jun MURAMATSU, Fumio KANAYA, "A Universal Data-Base for Data Compression" in IEICE TRANSACTIONS on Fundamentals,
vol. E78-A, no. 9, pp. 1057-1062, September 1995, doi: .
Abstract: A data-base for data compression is universal if in its construction no prior knowledge of the source distribution is assumed and is optimal if, when we encode the reference index of the data-base, its encoding rate achieves the optimal encoding rate for any given source: in the noiseless case the entropy rate and in the semifaithful case the rate-distortion function of the source. In the present paper, we construct a universal data-base for all stationary ergodic sources, and prove the optimality of the thus constructed data-base for two typical methods of referring to the data-base: one is a block-shift type reference and the other is a single-shift type reference.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e78-a_9_1057/_p
Copy
@ARTICLE{e78-a_9_1057,
author={Jun MURAMATSU, Fumio KANAYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Universal Data-Base for Data Compression},
year={1995},
volume={E78-A},
number={9},
pages={1057-1062},
abstract={A data-base for data compression is universal if in its construction no prior knowledge of the source distribution is assumed and is optimal if, when we encode the reference index of the data-base, its encoding rate achieves the optimal encoding rate for any given source: in the noiseless case the entropy rate and in the semifaithful case the rate-distortion function of the source. In the present paper, we construct a universal data-base for all stationary ergodic sources, and prove the optimality of the thus constructed data-base for two typical methods of referring to the data-base: one is a block-shift type reference and the other is a single-shift type reference.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Universal Data-Base for Data Compression
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1057
EP - 1062
AU - Jun MURAMATSU
AU - Fumio KANAYA
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E78-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1995
AB - A data-base for data compression is universal if in its construction no prior knowledge of the source distribution is assumed and is optimal if, when we encode the reference index of the data-base, its encoding rate achieves the optimal encoding rate for any given source: in the noiseless case the entropy rate and in the semifaithful case the rate-distortion function of the source. In the present paper, we construct a universal data-base for all stationary ergodic sources, and prove the optimality of the thus constructed data-base for two typical methods of referring to the data-base: one is a block-shift type reference and the other is a single-shift type reference.
ER -
English
