| Co-Investigator(Renkei-kenkyūsha) |
SAWABE Masato 千葉大学, 教育学部, 准教授 (60346624)
MUNEMASA Akihiro 東北大学, 大学院情報科学研究科, 教授 (50219862)
CHIGIRA Naoki 熊本大学, 大学院先端科学研究部, 准教授 (40292073)
HARADA Masaaki 東北大学, 大学院情報科学研究科, 教授 (90292408)
ABE Toshiyuki 愛媛大学, 教育学部, 教授 (30380215)
SHIMAKURA Hiroki 東北大学, 大学院情報科学研究科, 准教授 (90399791)
|
|---|
| Budget Amount *help |
¥13,780,000 (Direct Cost: ¥10,600,000、Indirect Cost: ¥3,180,000)
Fiscal Year 2016: ¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2015: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2014: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2013: ¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
Fiscal Year 2012: ¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
|
|---|
| Outline of Final Research Achievements |
We have studied the Rudvalis simple group and related algebraic structures (code, lattice) and combinatorial structure (graph, design). Consequently we show the existence of even self-dual code preserved by the Rudvalis group, and give a combinatorial description of some generator. We further define five 2-designs by using a unitary group, and give a new construction of the Rudvalis graph from these 2-designs. We also consider Conway's theorem, which show the relation between the Rudvalis graph and the Hoffman-Singleton graph.
Moreover we have completed the classification of extremal doubly even self-dual codes with 2-transitive automorphism groups by showing non-existence of the remaining case.
|
