The search functionality is under construction.

The search functionality is under construction.

The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. We define the average coding rate as (ii) the expectation of the pointwise coding rate, and prove that (ii) converges to the same value as (i).

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.11 pp.1904-1911

- Publication Date
- 2010/11/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E93.A.1904

- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)

- Category
- Source Coding

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.

Copy

Mitsuharu ARIMURA, "On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 1904-1911, November 2010, doi: 10.1587/transfun.E93.A.1904.

Abstract: The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. We define the average coding rate as (ii) the expectation of the pointwise coding rate, and prove that (ii) converges to the same value as (i).

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1904/_p

Copy

@ARTICLE{e93-a_11_1904,

author={Mitsuharu ARIMURA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources},

year={2010},

volume={E93-A},

number={11},

pages={1904-1911},

abstract={The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. We define the average coding rate as (ii) the expectation of the pointwise coding rate, and prove that (ii) converges to the same value as (i).},

keywords={},

doi={10.1587/transfun.E93.A.1904},

ISSN={1745-1337},

month={November},}

Copy

TY - JOUR

TI - On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1904

EP - 1911

AU - Mitsuharu ARIMURA

PY - 2010

DO - 10.1587/transfun.E93.A.1904

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E93-A

IS - 11

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - November 2010

AB - The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. We define the average coding rate as (ii) the expectation of the pointwise coding rate, and prove that (ii) converges to the same value as (i).

ER -