- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | A Note on a Sampling Theorem for Functions over $GF(q)^n$ Domain (in Japanese) |
|---|---|
| Authors | Yoshifumi Ukita 、Tomohiko Saito 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2010 |
| Format | Journal |
| Category | Channel coding |
| Jounal Name | IEICE Trans. Fundamentals |
| Jounal Page | vol.E93-A, no.6, pp.1024-1031 |
| Published Year | 2010 |
| Published Month | 6 |
| Abstract （English） |
In digital signal processing, the sampling theorem states that any real valued function $f$ can be reconstructed from a sequence of values of $f$ that are discretely sampled with a frequency at least twice as high as the maximum frequency of the spectrum of $f$. This theorem can also be applied to functions over finite domain. Then, the range of frequencies of $f$ can be expressed in more detail by using a bounded set instead of the maximum frequency. A function whose range of frequencies is confined to a bounded set is referred to as bandlimited function. And a sampling theorem for bandlimited functions over Boolean domain has been obtained. However, it is important to obtain a sampling theorem for bandlimited functions not only over Boolean domain($GF(2)^n$ domain) but also over $GF(q)^{n}$ domain, where $q$ is a prime power and $GF(q)$ is Galois field of order $q$. For example, in experimental designs, although the model can be expressed as a linear combination of the Fourier basis functions and the levels of each factor can be represented by $GF(q)$, the number of levels often take a value greater than two. However, the sampling theorem for bandlimited functions over $GF(q)^{n}$ domain has not been obtained. On the other hand, the sampling points are closely related to the codewords of a linear code. However, the relation between the parity check matrix of a linear code and any distinct error vectors has not been obtained, although it is necessary for understanding the meaning of the sampling theorem for bandlimited functions. In this paper, we generalize the sampling theorem for bandlimited functions over Boolean domain to a sampling theorem for bandlimited functions over $GF(q)^{n}$ domain. We also present a theorem for the relation between the parity check matrix of a linear code and any distinct error vectors. Lastly, we clarify the relation between the sampling theorem for functions over $GF(q)^{n}$ domain and linear codes. |
| Note （English） |
3 |
| Manuscript | |
| Presentation |
Involved Papers
- 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
- On Precise Achievable Conditions in Resolvability Problem Based on the Asymptotic Normality
