Name
Abstract | ||
|---|---|---|
Recently, there has been an upsurge of interest in using Code-Division Multiple-Access communication over optical fiber channels (OCDMA). In this paper we provide a new Johnson-bound-optimal construction of OOC with parameter λ = 1. We use the idea of the same construction to generate OOCs with λ 1. A new bound for optical orthogonal codes based on a known bound for constant weight codes is introduced. This bound is used to prove the optimality of our constructions. We also present a recursive technique for generating OOCs with λ = 1 that makes use of a recursive construction for cyclic block designs by Colbourn and Colbourn [1]. This technique has yielded several new optimal constructions for Optical Orthogonal Codes. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/11423461_30 | SETA |
Keywords | Field | DocType |
block design,constant weight code,optical fiber,code division multiple access | Discrete mathematics,Optical fiber,Constant-weight code,Optical communication,Algorithm,Block design,Code generation,Primitive element,Code division multiple access,Recursion,Mathematics | Conference |
Volume | ISSN | ISBN |
3486 | 0302-9743 | 3-540-26084-6 |
Citations | PageRank | References |
1 | 0.38 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Reza Omrani | 1 | 30 | 4.36 |
| Oscar Moreno | 2 | 19 | 2.83 |
| P. Vijay Kumar | 3 | 1708 | 158.95 |