- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Almost sure source coding theorems for general sources
Description
For a source /spl mu/, which is assumed to be a probability measure on all strings of infinite length sequence with a finite alphabet, the notion of the almost-sure entropy rate is defined; it is an extension of the Shannon (1948) entropy rate. When both an encoder and a decoder know that a sequence is generated by /spl mu/, the optimal almost sure source coding rate is equal to the almost sure sup entropy rate.
Journal
-
- Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
-
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) 428-, 2002-11-27
IEEE