Skip navigation
Skip navigation

On the Entropy Rate of Word-Valued Sources

Timo, Roy; Blackmore, Kim; Hanlen, Leif

Description

A word-valued source Y is a discrete finite alphabet random process which is created by encoding a discrete random process X with a symbol-to-word function f. In Information Theory (in particular source coding), it is of interest to know which word valued sources possess an entropy rate H̄(Y). Nishiara and Morita showed that if X is independent and identically distributed and f is prefix free, then H̄(Y) exists and is equal to H̄(X) divided the expected codeword length. This "conservation of...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
URI: http://hdl.handle.net/1885/55115
Source: Proceedings of the Australasian Telecommunication Networks and Applications Conference
DOI: 10.1109/ATNAC.2007.4665292

Download

File Description SizeFormat Image
01_Timo_On_the_Entropy_Rate_of_2007.pdf149.56 kBAdobe PDF    Request a copy
02_Timo_On_the_Entropy_Rate_of_2007.pdf225.44 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator