Bulletin of the Japan Society for Industrial and Applied Mathematics
Online ISSN : 2432-1982
Coding Theorems on General Sources(<Special Topics>Data Compression)
Shigeki Miyake
Author information
JOURNAL FREE ACCESS

1998 Volume 8 Issue 2 Pages 133-146

Details
Abstract
In most cases treated in information theory, stationary memoryless/ergodic property on the system are assumed. In this paper, source coding theorems on the general information sources, which means neither stationary memoryless nor stationary ergodic property are conditioned, are considered. We clarify the following two issues: 1) What quantity can be essential in source coding problems under the general sources? 2) What are the differences between theorems under conventional stationary memoryless/ergodic condition and ones under the general sources?
Content from these authors
© 1998 The Japan Society for Industrial and Applied Mathematics
Previous article Next article
feedback
Top