Contract grant sponsor: NSFC; contract grant numbers: 61071221, 11271042; contract grant sponsor: Fundamental Research Funds for the Central Universities; contract grant number: 2011JBZ012.
Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes
Version of Record online: 11 JUL 2013
© 2013 Wiley Periodicals, Inc.
Journal of Combinatorial Designs
Volume 22, Issue 11, pages 453–472, November 2014
How to Cite
Wang, L. and Chang, Y. (2014), Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes. J. Combin. Designs, 22: 453–472. doi: 10.1002/jcd.21362
- Issue online: 8 SEP 2014
- Version of Record online: 11 JUL 2013
- Manuscript Revised: 8 JUN 2013
- Manuscript Received: 23 MAR 2013
- NSFC. Grant Numbers: 61071221, 11271042
- Fundamental Research Funds for the Central Universities. Grant Number: 2011JBZ012
- optical orthogonal code;
- H design;
In this paper, we are concerned about optimal (v, 4, 3, 2)-OOCs. A tight upper bound on the exact number of codewords of optimal (v, 4, 3, 2)-OOCs and some direct and recursive constructions of optimal (v, 4, 3, 2)-OOCs are given. As a result, the exact number of codewords of an optimal (v, 4, 3, 2)-OOC is determined for some infinite series.