New optimal optical orthogonal codes by restrictions to subgroups
New optimal optical orthogonal codes by restrictions to subgroups
复制标题
DOI：
10.1016/j.ffa.2010.11.001
复制
发表时间：
2011-03
期刊：
影响因子：
--
通讯作者：
K. Momihara
中科院分区：
文献类型：
--
作者：
K. Momihara
In this paper, we discuss about restrictions of optical orthogonal codes (OOC) to subgroups and obtain variable weight OOCs in which the weight of each codeword is lower and upper bounded in relation to a character sum over finite fields. We show that the following three new series of optimal or asymptotically optimal constant weight OOCs are included in those variable weight ones: (i) an optimal (q2−1e,⌈q−(e−1)qe⌉,1)-OOC with e codewords; (ii) an optimal (q2+q+1e,⌈q+1−(e−1)qe⌉,1)-OOC with e codewords; and (iii) an asymptotically optimal (q2−1e,⌈q−3(e−1)qe⌉,2)-OOC with e(q−1) codewords.
