Name
Abstract | ||
|---|---|---|
In this paper two recursive constructions for optimal optical orthogonal codes are presented by means of incomplete difference matrices and perfect cyclic difference packings. These improve the known existence results concerning optimal (v,4,1)-OOCs. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0012-365X(02)00464-8 | Discrete Mathematics |
Keywords | Field | DocType |
cyclic difference packing,05b07,94b25,incomplete difference matrix,optimal optical orthogonal code,recursive construction,known existence result,perfect cyclic difference packing,optical orthogonal code | Discrete mathematics,Combinatorics,Matrix (mathematics),Mathematics,Recursion | Journal |
Volume | Issue | ISSN |
261 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
51 | 2.46 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanxun Chang | 1 | 321 | 45.91 |
| Ying Miao | 2 | 491 | 43.85 |