Constructions of combinatorial designs leading to quantum codes and protocol sequences for multiple-access communication channel
| Project/Area Number |
25400200
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Foundations of mathematics/Applied mathematics
|
|---|
| Research Institution | Gifu University |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
JIMBO MASAKAZU 中部大学, 現代教育学部, 教授 (50103049)
|
|---|
| Project Period (FY) |
2013-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2014: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2013: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
|---|
| Keywords | 衝突回避符号 / デザインの分割 / アフィン幾何 / サイクル分解 / conflict-avoiding code / decomposition / Affine geometry / Jacobi sum / Weil sum / order of unit / t-SEED |
|---|
| Outline of Final Research Achievements |
t-SEED, a class of combinatorial designs which gives quantum jump codes, has been characterized and some recursive constructions of t-SEEDs have been obtained. It is known that the 2-design formed by the planes in affine geometry can be decomposed into subdesigns, which satisfies a property of t-SEEDs. We have shown a decomposition of the 2-design formed by the planes in AG(2n,4) into subdesigns stabilized by the action of the affine general linear group AGL(1,pow(4,2n)), which gives the larger number of subdesigns than the previously known decomposition.
As for confilict-avoiding codes (CAC), some explicit series of tight/optimal equi-difference CACs and tight CACs of odd length and weight 3 have been provided. Furthermore, restricting to equi-difference codes, several series of infinite number of optimal equi-difference CACs have been obtained together with the recursion formulae of the number of codewords.
|
Report
(4 results)
Research Products
(36 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Erdos-Renyi theory for asymmetric digraphs2015
Author(s)
Shohei Satake，Masanori Sawa and Masakazu Jimbo
Organizer
The 39th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (39ACCMCC)
Place of Presentation
University of Queensland (オーストラリア)
Year and Date
2015-12-08
Related Report
Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
