By Topic

Two-Dimensional Optical Orthogonal Codes and Semicyclic Group Divisible Designs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jianmin Wang ; Department of Mathematics, Suzhou University, Suzhou, China ; Jianxing Yin

A (nxm, k, ¿) two-dimensional optical orthogonal code (2-D OOC), C, is a family of nxm (0, 1)-arrays of constant weight k such that ¿i=1n¿j=0m-1A(i, j)B(i, j¿m¿) ¿ ¿ for any arrays A, B in C and any integer ¿ except when A = B and ¿ ¿ 0 (mod m ), where ¿m denotes addition modulo m. Such codes are of current practical interest as they enable optical communication at lower chip rate. To simplify practical implementation, the AM-OPPW (at most one-pulse per wavelength) restriction is often appended to a 2-D OOC. An AM-OPPW 2-D OOC is optimal if its size is the largest possible. In this paper, the notion of a perfect AM-OPPW 2-D OOC is proposed, which is an optimal (nxm, k, ¿) AM-OPPW 2-D OOC with cardinality [(m ¿ n(n-1)...(n-¿))/(k(k-1)...(k-¿))] . A link between optimal (nxm, k, ¿) AM-OPPW 2-D OOCs and block designs is developed. Some new constructions for such optimal codes are described by means of semicyclic group divisible designs. Several new infinite families of perfect (nxm, k, 1) AM-OPPW 2-D OOCs with k ¿ {2, 3, 4} are thus produced.

Published in:

IEEE Transactions on Information Theory  (Volume:56 ,  Issue: 5 )