DocumentCode :
60378
Title :
Optimal 2-D (n\\times m,3,2,1) -optical Orthogonal Codes
Author :
Xiaomiao Wang ; Yanxun Chang ; Tao Feng
Author_Institution :
Dept. of Math., Ningbo Univ., Ningbo, China
Volume :
59
Issue :
1
fYear :
2013
fDate :
Jan. 2013
Firstpage :
710
Lastpage :
725
Abstract :
Optical orthogonal codes are commonly used as signature codes for optical code-division multiple access systems. So far, research on 2-D optical orthogonal codes has mainly concentrated on the same autocorrelation and cross-correlation constraints. In this paper, we are concerned about optimal 2-D optical orthogonal codes with the autocorrelation λa and the cross-correlation 1. Some combinatorial constructions for 2-D (n×m,ka,1) -optical orthogonal codes are presented. When k=3 and λa=2, the exact number of codewords of an optimal 2-D (n×m,3,2,1)-optical orthogonal code is determined for any positive integers n ≡ 0,1,3,6,9,10 (mod 12) and m ≡ 2(mod 4).
Keywords :
code division multiple access; code division multiplexing; correlation methods; orthogonal codes; autocorrelation constraint; codewords; combinatorial constructions; cross-correlation constraint; optical code-division multiple access systems; optimal 2D-optical orthogonal codes; signature codes; Correlation; Multiaccess communication; Upper bound; Group divisible design (GDD); optical code-division multiple access (OCDMA); optical orthogonal code; optimal; two-dimensional optical orthogonal code;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2012.2214025
Filename :
6336825
Link To Document :
بازگشت