| Budget Amount *help |
¥14,300,000 (Direct Cost: ¥11,000,000、Indirect Cost: ¥3,300,000)
Fiscal Year 2015: ¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2014: ¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
Fiscal Year 2013: ¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2012: ¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
|
|---|
| Outline of Final Research Achievements |
We generalized the encode-decode duality theorem into polynomial maps. The key idea is to represent maximum likelihood decoding as generalized MacWilliams identity. We also studied numerical experiments and found that the performance of the proposed method is quite better than conventional methods. For the subject on network coding and sheaf cohomology, we studied a formulation using quiver representations. We derived an algorithm for indecomposable decompositions on several explicit examples, and studied the structure on representation category.
|
