Premium
Bounds and Constructions on ( v , 4, 3, 2) Optical Orthogonal Codes
Author(s) -
Wang Lidong,
Chang Yanxun
Publication year - 2014
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21362
Subject(s) - mathematics , combinatorics , series (stratigraphy) , upper and lower bounds , discrete mathematics , mathematical analysis , paleontology , biology
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom