| タイトル | On Precise Achievable Conditions in Resolvability Problem Based on the Asymptotic Normality |
|---|---|
| 著者 | 野村亮 、松嶋敏泰 |
| 年度 | 2009 |
| 形式 | 論文誌 |
| 分野 | 情報源符号化 |
| 掲載雑誌名 | Far East Journal of Electronics and Communications |
| 掲載号・ページ | vol.3, no.3, pp.85-99 |
| 掲載年 | 2009 |
| 掲載月 | 8 |
| アブスト （日本語） |
査読：あり DOI: なし |
| アブスト （英語） |
Random number generation problem is one of the main topics in information theory. The resolvability problem is a kind of random number generation problems and formulated as follows. Given an arbitrary discrete random variables (called a source or a target random number), we generate it by using a discrete uniform random number whose size is as small as possible under the condition that the distance between the probability distribution of the source and the probability distribution of random variables to be generated is small. One of main problems in this setting is to construct the efficient algorithm and the other is to show the achievable condition. The achievable condition for the source guarantees following. That is, there exists an algorithm under the condition that the distance between the probability distribution of the source and the probability distribution of random variables to be generated is small. Steinberg et al.\ and Han et al.\ showed the achievable condition for an arbitrary given general sources by using information spectrum methods. The class of general sources is quite large, so their result is very important. However their result is not so precise, since the general source has no assumption for the source such as the consistency condition. On the other hand it is important to show the achievable condition more precisely by using the assumption for the source. In this paper we show the achievable condition more precisely by using the asymptotic normality. |
| 備考 （日本語） |
3 |
| 備考 （英語） |
3 |
| 論文原稿 | |
| 発表資料 |
関連論文
- 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
- Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
- 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
