为支持高速多址网络中二维图像的传输,Kitayama首次提出码分多址并行图像传输系统的概念.作为码分多址并行图像传输系统的首选光地址码,光正交签名码(OOSPC)是一族具有良好相关性的Hamming重量为k的m×n(0,1)-矩阵.用Θ(m,n,k,λ)表示所有参数为(m,n,k,λ)的OOSPC中码字容量可能的最大值,则称码字容量为Θ(m,n,k,λ)的(m,n,k,λ)-OOSPC是最优的.本文将针对满足下列条件之一的正整数m和n:(1)mn≡8,16(mod 24),gcd(m,n,2)=2,且mn≡16(mod 32)和gcd(m,n,4)=2不同时成立,其中m和n的所有奇素因子均模6余1;(2)mn≡0(mod 24)且gcd(m,n,6)=2,证明Θ(m,n,4,1)=|mn-1/12|,即构造码字容量为|mn-1/12|的最优(m,n,4,1)-OOSPC. To support the transmission of two-dimensional images in high-speed multi-access networks, Kitayama first proposed the concept of code division multiple access parallel image transmission system.As the preferred optical address code, OOSPC (Orthogonal Signature Code) Is a family of m × n (0,1) - matrices with a Hamming weight of k with good relativity. All OOSPCs with the parameters (m, n, k, λ) are represented by Θ (M, n, k, λ) -OOSPC, whose code word size is Θ (m, n, k, λ) is optimal.This paper will focus on the following conditions Positive integers m and n: (1) mn≡8,16 (mod 24), gcd (m, n, 2) = 2, and mn≡16 (mod 32) and gcd (m, n, 4) = 2 (2) mn≡0 (mod 24) and gcd (m, n, 6) = 2 prove that Θ (m, n, 4, 1 ) = | mn-1/12 |, that is, the optimal (m, n, 4,1) -OOSPC with the codeword size of | mn-1/12 |