## Word-Valued Sources: An Ergodic Theorem, an AEP, and the Conservation of Entropy

### Description

A word-valued source Y = Y1,Y2,̇ ̇ ̇ is discrete random process that is formed by sequentially encoding the symbols of a random process ${\bf X} = X1,X2 ̇ ̇ ̇ with codewords from a codebook. These processes appear frequently in information theory (i dc.contributor.author Timo, Roy Blackmore, Kim Hanlen, Leif 2015-12-10T22:59:30Z 0018-9448 http://hdl.handle.net/1885/61119 A word-valued source Y = Y1,Y2,̇ ̇ ̇ is discrete random process that is formed by sequentially encoding the symbols of a random process${\bf X} = X1,X2 ̇ ̇ ̇ with codewords from a codebook. These processes appear frequently in information theory (i Institute of Electrical and Electronics Engineers (IEEE Inc) IEEE Transactions on Information Theory Keywords: Average codeword length; Code-words; Codebooks; Entropy rates; Equipartition; Ergodic theorem; Prefix-free; Source-coding algorithm; Entropy; Random processes; Signal theory; Asymptotic analysis Asymptotic equipartition property (AEP); Asymptotically mean stationary (AMS); Ergodic theorem Word-Valued Sources: An Ergodic Theorem, an AEP, and the Conservation of Entropy Journal article Imported from ARIES 56 2010 080299 - Computation Theory and Mathematics not elsewhere classified u4334215xPUB588 Published Version Timo, Roy, University of South Australia Blackmore, Kim, College of Engineering and Computer Science, ANU Hanlen, Leif, NICTA 2037-12-31 7 3139 3148 10.1109/TIT.2010.2046251 970108 - Expanding Knowledge in the Information and Computing Sciences 2016-02-24T11:02:09Z 2-s2.0-77953788015 000278812000006 ANU Research Publications

File Description SizeFormat Image