光正交码

Optical Orthogonal Codes

本文求出了光正交码最大容量φ(n,w、λ)的几个精确公式,并首次对容量固定为v后(n、w,λ)光正交码的最大可能个数ψ(v、n、m、λ)进行了研究,给出了几个上、下界公式。最后讨论了光正交码的构造问题。文中还提出了许多尚待解决的问题。

Let φ(n w, λ) be the largest possible number of codewords in a (n, w, λ) optical orthogonal code (OOC) and ψ(v, n, w,λ) be the maximum of the enumeration of OOC with volume v. This paper shows a few exact values about ψ(n, w, λ) and lower and upper bounds about the ψ(v, n, w,λ). Constructions of OOC are also studied. Some open problems are proposed.