IEICE TRANSACTIONS on Fundamentals
New Asymptotically Optimal Optical Orthogonal Signature Pattern Codes from Cyclic Codes
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.10 pp.1416-1419
- Publication Date
- 2019/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E102.A.1416
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Lin-Zhi SHEN
Civil Aviation University of China
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Lin-Zhi SHEN, "New Asymptotically Optimal Optical Orthogonal Signature Pattern Codes from Cyclic Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 10, pp. 1416-1419, October 2019, doi: 10.1587/transfun.E102.A.1416.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1416/_p
Copy
@ARTICLE{e102-a_10_1416,
author={Lin-Zhi SHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={New Asymptotically Optimal Optical Orthogonal Signature Pattern Codes from Cyclic Codes},
year={2019},
volume={E102-A},
number={10},
pages={1416-1419},
abstract={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.},
keywords={},
doi={10.1587/transfun.E102.A.1416},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - New Asymptotically Optimal Optical Orthogonal Signature Pattern Codes from Cyclic Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1416
EP - 1419
AU - Lin-Zhi SHEN
PY - 2019
DO - 10.1587/transfun.E102.A.1416
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2019
AB - 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.
ER -
English
