Optical orthogonal codes and arcs in PG (d,q)

Authors:
T. L. Alderson
Affiliations:
Department of Mathematical Sciences, University of New Brunswick, Saint John, New Brunswick, E2L 4L5, Canada
Venue:
Finite Fields and Their Applications
Year:
2007

Citing 5
Cited 1

Optical orthogonal codes: design, analysis and applications

IEEE Transactions on Information Theory
Optical orthogonal codes-new bounds and an optimal construction

IEEE Transactions on Information Theory
Constructions of binary constant-weight cyclic codes and cyclically permutable codes

IEEE Transactions on Information Theory
New constructions of optimal cyclically permutable constant weight codes

IEEE Transactions on Information Theory
Optical orthogonal codes obtained from conics on finite projective planes

Finite Fields and Their Applications

New optimal optical orthogonal codes by restrictions to subgroups

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new construction for (n,w,@l)-optical orthogonal codes (OOCs). The construction is pleasingly simple, where codewords correspond to arcs, specifically normal rational curves. Moreover, our construction yields for each @l1 an infinite family of OOCs which are asymptotically optimal (with respect to the Johnson bound).