Maximum two-dimensional (u×v,4,1,3)-OOCs  

作　　者：HUANG Yue-mei CHANG Yan-xun 

机构地区：[1]Institute of Mathematics, Beijing Jiaotong University [2]Mathematics Science college, Inner Mongolia Normal University

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》2013年第3期279-289,共11页高校应用数学学报（英文版）（B辑）

基　　金：Supported by the National Natural Science Foundation of China(61071221,10831002)

摘　　要：Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.

关 键 词：MAXIMUM two-dimensional optical orthogonal code orbit. 

分 类 号：O157.4[理学—数学]