The Redundancy of Universal Coding with a Fidelity Criterion
Summary :
The redundancy of universal lossy data compression for discrete memoryless sources is considered in terms of type and d-ball covering. It is shown that there exists a universal d-semifaithful code whose rate redundancy is upper bounded by (A-1/2)n-1ln n+o(n-1ln n), where A is the cardinality of source alphabet and n is the block length of the code. This new bound is tighter than known ones, and moreover, it turns out to be the attainable minimum of the universal coding proposed by Davisson.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.11 pp.2225-2231
- Publication Date
- 1997/11/25
- Publicized
- Online ISSN
- DOI
- 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
Daiji ISHII, Hirosuke YAMAMOTO, "The Redundancy of Universal Coding with a Fidelity Criterion" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 11, pp. 2225-2231, November 1997, doi: .
Abstract: The redundancy of universal lossy data compression for discrete memoryless sources is considered in terms of type and d-ball covering. It is shown that there exists a universal d-semifaithful code whose rate redundancy is upper bounded by (A-1/2)n-1ln n+o(n-1ln n), where A is the cardinality of source alphabet and n is the block length of the code. This new bound is tighter than known ones, and moreover, it turns out to be the attainable minimum of the universal coding proposed by Davisson.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_11_2225/_p
Copy
@ARTICLE{e80-a_11_2225,
author={Daiji ISHII, Hirosuke YAMAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Redundancy of Universal Coding with a Fidelity Criterion},
year={1997},
volume={E80-A},
number={11},
pages={2225-2231},
abstract={The redundancy of universal lossy data compression for discrete memoryless sources is considered in terms of type and d-ball covering. It is shown that there exists a universal d-semifaithful code whose rate redundancy is upper bounded by (A-1/2)n-1ln n+o(n-1ln n), where A is the cardinality of source alphabet and n is the block length of the code. This new bound is tighter than known ones, and moreover, it turns out to be the attainable minimum of the universal coding proposed by Davisson.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - The Redundancy of Universal Coding with a Fidelity Criterion
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2225
EP - 2231
AU - Daiji ISHII
AU - Hirosuke YAMAMOTO
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1997
AB - The redundancy of universal lossy data compression for discrete memoryless sources is considered in terms of type and d-ball covering. It is shown that there exists a universal d-semifaithful code whose rate redundancy is upper bounded by (A-1/2)n-1ln n+o(n-1ln n), where A is the cardinality of source alphabet and n is the block length of the code. This new bound is tighter than known ones, and moreover, it turns out to be the attainable minimum of the universal coding proposed by Davisson.
ER -
English
