Constructions of optimal optical orthogonal codes and conflict-avoiding codes derived from combinatorial designs
| Project/Area Number |
22540121
|
|---|
| 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 | Gifu University |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
JIMBO Masakazu 名古屋大学, 大学院・情報科学研究科, 教授 (50103049)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | 組合せ論 / Affine geometry / decomposition / 2-design / Jacobi sum / Weil sum / conflict-avoiding code / multiplicative order / cyclotomic polynomial / Skolem type sequence / Conflict-avoiding code / Design decomposition / 2-flats in an affine geometry |
|---|
| Research Abstract |
By applying Jacobi sums and some related number theoretic results, it is shown that the 2-design formed by the 2-flats in AG(2n,3) can be decomposed into more subdesigns than a previously known decomposition. At the same time, exact evaluation of the number of the resulting subdesigns is also demonstrated by examining the distribution of points in cyclotomic cosets. The original purpose of this theme was to find constructions of Steiner quadruple systems which can be applied to optimal optical orthogonal codes, but the result eventually turned out to be applicable to secret sharing scheme and quantum jump codes. As for conflict-avoiding codes, direct constructions for optimal codes of length n≡4 (mod 8) and weight 3 are provided by bringing in a new concept called an extended odd sequence. As a consequence, with previously known results, the spectrum of the size of optimal conflict-avoiding codes of even length and weight 3 is completely settled.
|
Report
(4 results)
Research Products
(49 results)
