(n,4,1,2)光正交码的上界

Bounds of(n,4,1,2)-Optical Orthogonal Codes

光正交码因其具有良好的光学性质,在码分多址系统(CDMA)中应用广泛。研究汉明权为4,自相关系数与互相关系数分别为2和1的光正交码的容量问题。根据3-子集轨道出现在码字中的次数,得到了较为紧密的(n,4,1,2)光正交码的上界。

Optical orthogonal codes are widely used in code-division multiple access systems(CDMA)because of their good optical properties.In the paper,we are concerned about the capacity of optimal optical orthogonal codes with hamming weight 4,the auto-correlation 2 and the cross-correlation 1.According to the number of 3-subset orbits appearing in the codeword,the tighter upper bound of(n,4,1,2)-OOC is determined.