Abstract

Let Φ(n,k,λa,λc) denote the largest possible size among all (n,k,λa,λc)-OOCs. An (n,k,λa,λc)-OOC with Φ(n,k,λa,λc) codewords is said to be optimal. In this paper, the exact value of Φ(n,4,λ,3) is determined. Equivalently, the size of an optimal (n,4,λ,3) optical orthogonal code is calculated.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call