- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | Asymptotic property of universal lossless coding for independent piecewise identically distributed sources (in Japanese) |
|---|---|
| Authors | Tota Suko 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2010 |
| Format | Journal |
| Category | Source coding |
| Jounal Name | Journal of Discrete Mathematical Sciences & Cryptography |
| Jounal Page | vol.13, no.4, pp.383-391 |
| Published Year | 2010 |
| Published Month | 8 |
| Abstract （English） |
The universal lossless source coding problem is one of the most important problem in communication systems. The aim of source coding is to compress data to reduce costs in digital communication. Traditional universal source coding schemes are usually designed for stationary sources. Recently, some universal codes for nonstationary sources have been proposed. Independent piecewise identically distributed (i.p.i.d.) sources are simple nonstationary sources that parameter changes discontinuously. In this paper, we assume new i.p.i.d. sources class, and we prove that Bayes codes minimize the mean redundancy when parameter transition pattern is known and parameter is unknown. |
| Note （English） |
3 |
| Manuscript | |
| Presentation |
Involved Papers
- An Efficient Bayes Coding Algorithm for the Source Based on Context Tree Models that Vary from Section to Section (in Japanese)
- A New Latent Class Model for Analysis of Purchasing and Browsing Histories on EC Sites
- Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channels
- A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
- Parallel Architecture for Generalized LFSR in LSI Built-In Self Testing
- Parallel Encoder and Decoder Architecture for Cyclic Codes
- A Generalization of B.S.Clarke and A.R.Barron's Asymptotics of Bayes Codes for FSMX Sources
- Almost Sure and Mean Convergence of Extended Stochastic Complexity
- A Source Model with Probability Distribution over Word Set and Recurrence Time Theorem
- Properties of a Word-Valued Source with a Non-prefix-free Word Set
- Asymptotics of Bayesian Inference for a Class of Probabilistic Models under Misspecification
- An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
- On the Overflow Probability of Fixed - to - Variable Length Codes with Side Information
- A Study on the Degrees of Freedom in an Experimental Design Model Based on an Orthonormal System
- A Note on Relation between the Fourier Coefficients and the Effects in the Experimental Design
- A Note on the Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel
- A Note on Automatic Construction Algorithms for Orthogonal Designs of Experiments Using Error-correcting Codes
- A Note on the Branch-and-Cut Approach to Decoding Linear Block Codes
- Estimation of the Effects in the Experimental Design using Fourier Transforms
- A Note on a Sampling Theorem for Functions over $GF(q)^n$ Domain
