A (k, d)-arc N in a projective plane PG(2, q) of order q is a set of k distinct points such that any line in the plane meets N in at most d points. In this article, we consider a family of (k, d)-arcs for several positive integers k, each pair of which has at most m points in common. Such a family is used to obtain a variable-weight optical orthogonal code, which is used to multimedia optical code division multiple access (CDMA) communications.
k-Arcs Variable-weight optical orthogonal codes
This is a preview of subscription content, log in to check access.
Fuji-Hara, R., and N. Miyamoto. 1999. Mutually M-intersecting Hermitian varieties. Finite Fields and Their Applications, 5, 285–293.MathSciNetCrossRefGoogle Scholar
Miyamoto, N., H. Mizuno, and S. Shinohara. 2004. Optical orthogonal codes obtained from conics on finite projective planes. Finite Fields and Their Applications, 10, 405–411.MathSciNetCrossRefGoogle Scholar
Miyamoto, N., and S. Shinohara. 2004. Mutually M-intersecting (k, d)-arcs and its application to optical orthogonal codes. Congressus Numerantium, 169, 23–31.MathSciNetMATHGoogle Scholar
Miyamoto, N., and S. Shinohara. 2009. The number of intersection points of conics with lines and an application to balanced arrays. Journal of Statistics and Applications, 4(2, 3), 465–473.MATHGoogle Scholar
Salehi, J. A. 1989. Code division multiple-access techniques in optical fiber networks. I. fundamental principles. IEEE Trans. Commun., 37, 824–833.CrossRefGoogle Scholar
Salehi, J. A., and C. A. Brackett. 1989. Code division multiple-access techniques in optical fiber networks. II. systems performance analysis. IEEE Trans. Commun., 37, 834–842.CrossRefGoogle Scholar
Yang, G. C. 1996. Variable-weight optical orthogonal codes for CDMA networks with multiple performance requirements. IEEE Trans. Commun., 44(1), 47–55.CrossRefGoogle Scholar