Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one
Combinatorics
2019-09-04 v2
Abstract
Optical orthogonal signature pattern codes (OOSPCs) have attracted wide attention as signature patterns of spatial optical code division multiple access networks. In this paper, an improved upper bound on the size of an -OOSPC with is established. The exact number of codewords of an optimal -OOSPC is determined for any positive integers and .
Keywords
Cite
@article{arxiv.1907.04588,
title = {Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one},
author = {Rong Pan and Tao Feng and Lidong Wang and Xiaomiao Wang},
journal= {arXiv preprint arXiv:1907.04588},
year = {2019}
}
Comments
To appear in Designs, Codes and Cryptography; According to the referees' comments, the proof of Theorem 1.3 was removed to the current arXiv version