Arithmetic Code-Like Variable-to-Variable Length Source Code with a Fidelity Criterion for Binary IID Sources
Summary :
This article proposes, given an independently-and-identically distributed binary source, an arithmetic code-like variable-to-variable length source code whose compression efficiency achieves nearly the rate function in a range of small distortion. Inheriting advantages of arithmetic codes, the proposed code requires neither large memory capacity nor large computation time for management of messages and codewords. The Elias code, which can be regarded as an antecedent of arithmetic codes, is defined originally in terms of the first-in-first-out (FIFO) coding form. The proposed code corresponds to an extension from the Elias code refined in terms of the last-in-first-out (LIFO) coding form into one considered a fidelity criterion.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.9 pp.1148-1158
- Publication Date
- 1992/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Information Theory and Coding Theory
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
Hisashi SUZUKI, Suguru ARIMOTO, "Arithmetic Code-Like Variable-to-Variable Length Source Code with a Fidelity Criterion for Binary IID Sources" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 9, pp. 1148-1158, September 1992, doi: .
Abstract: This article proposes, given an independently-and-identically distributed binary source, an arithmetic code-like variable-to-variable length source code whose compression efficiency achieves nearly the rate function in a range of small distortion. Inheriting advantages of arithmetic codes, the proposed code requires neither large memory capacity nor large computation time for management of messages and codewords. The Elias code, which can be regarded as an antecedent of arithmetic codes, is defined originally in terms of the first-in-first-out (FIFO) coding form. The proposed code corresponds to an extension from the Elias code refined in terms of the last-in-first-out (LIFO) coding form into one considered a fidelity criterion.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_9_1148/_p
Copy
@ARTICLE{e75-a_9_1148,
author={Hisashi SUZUKI, Suguru ARIMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Arithmetic Code-Like Variable-to-Variable Length Source Code with a Fidelity Criterion for Binary IID Sources},
year={1992},
volume={E75-A},
number={9},
pages={1148-1158},
abstract={This article proposes, given an independently-and-identically distributed binary source, an arithmetic code-like variable-to-variable length source code whose compression efficiency achieves nearly the rate function in a range of small distortion. Inheriting advantages of arithmetic codes, the proposed code requires neither large memory capacity nor large computation time for management of messages and codewords. The Elias code, which can be regarded as an antecedent of arithmetic codes, is defined originally in terms of the first-in-first-out (FIFO) coding form. The proposed code corresponds to an extension from the Elias code refined in terms of the last-in-first-out (LIFO) coding form into one considered a fidelity criterion.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Arithmetic Code-Like Variable-to-Variable Length Source Code with a Fidelity Criterion for Binary IID Sources
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1148
EP - 1158
AU - Hisashi SUZUKI
AU - Suguru ARIMOTO
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1992
AB - This article proposes, given an independently-and-identically distributed binary source, an arithmetic code-like variable-to-variable length source code whose compression efficiency achieves nearly the rate function in a range of small distortion. Inheriting advantages of arithmetic codes, the proposed code requires neither large memory capacity nor large computation time for management of messages and codewords. The Elias code, which can be regarded as an antecedent of arithmetic codes, is defined originally in terms of the first-in-first-out (FIFO) coding form. The proposed code corresponds to an extension from the Elias code refined in terms of the last-in-first-out (LIFO) coding form into one considered a fidelity criterion.
ER -
English
