| Project/Area Number |
14540111
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Nagoya University |
|---|
Principal Investigator |
IHARA Shunsuke Nagoya University, Graduate School of Information Science, Professor, 情報科学研究科, 教授 (00023200)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
SATO Junya Nagoya University, Graduate School of Information Science, Associate Professor, 情報科学研究科, 助教授 (20235352)
MATSUBARA Yo Nagoya University, Graduate School of Information Science, Associate Professor, 情報科学研究科, 助教授 (30242788)
MATSUMOTO Hiroyuki Nagoya University, Graduate School of Information Science, Professor, 情報科学研究科, 教授 (00190538)
TSUKIJI Tatsuie Tokyo Electrical University, School of Eng. and Sci., Associate Professor, 理工学部, 助教授 (70291961)
|
|---|
| Project Period (FY) |
2002 – 2003
|
| Project Status |
Completed (Fiscal Year 2003)
|
| Budget Amount *help |
¥2,700,000 (Direct Cost: ¥2,700,000)
Fiscal Year 2003: ¥1,200,000 (Direct Cost: ¥1,200,000)
Fiscal Year 2002: ¥1,500,000 (Direct Cost: ¥1,500,000)
|
|---|
| Keywords | Gaussian channel / Source coding / Channel coding / Waiting time for string matching / Large deviation theorem |
|---|
| Research Abstract |
We have studied on stochastic processes and information theory and obtained the following results.
[1]Error probability for Gaussian channels with feedback.
For the white Gaussian channel with feedback, it is known that the error probability decreases to zero more rapidly than the exponential of any order. Note that the precise proof of this fact is not familiar. We have given a new proof for this fact, not only for the discrete-time case but also for the continuous-time white Gaussian channel with feedback.
[2]Error exponents for the source coding with distortion.
For the lossy source coding, if the coding rate is greater than the rate distortion function, Marton (1974) proved that, for the stationary memoryless source with finite alphabet, the optimum error probability, namely the minimum probability of distortion exceeding a prescribed level, decreases to zero exponentially fast and gave a formula for the error exponent. We extended the Marton's results to the stationary memoryless sources with general alphabet and, proved that the Marton's formula remains true even if the alphabet is not finite.
[3]Asymptotic behavior of probability of string matching.
Applying a large deviation theorem to Gaussian stationary processes, we obtained formulas of the asymptotic behavior of probability of string matching and of the waiting time for string matching.
|
