New Asymptotically Optimal Optical Orthogonal Signature Pattern Codes from Cyclic Codes

Lin-Zhi SHEN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.10   pp.1416-1419
Publication Date: 2019/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.1416
Type of Manuscript: LETTER
Category: Coding Theory
optical orthogonal signature pattern code,  cyclic code,  Reed-Solomon code,  generalized Berlekamp-Justesen code,  

Full Text: PDF(176KB)>>
Buy this Article

Optical orthogonal signature pattern codes (OOSPCs) have attracted great attention due to their important application in the spatial code-division multiple-access network for image transmission. In this paper, we give a construction for OOSPCs based on cyclic codes over Fp. Applying this construction with the Reed-Solomon codes and the generalized Berlekamp-Justesen codes, we obtain two classes of asymptotically optimal OOSPCs.