AUTHORS: T. L. Alderson

Download as PDF

ABSTRACT: New constructions of 3-dimensional optical orthogonal codes are presented. In each case the codes have ideal autocorrelation a = 0, and cross correlation of c = 1. All codes produced are demonstrated to be optimal. The constructions utilize a particular automorphism (a Singer cycle) of PG(k; q), the finite projective geometry of dimension k over the field of order q, or its affine analogue in AG(k; q).

KEYWORDS: 3-D code, 3-D OOC, Optical Orthogonal Codes, Johnson bound, finite projective geometries, PG(k,q), Singer cycle, optimal codes

REFERENCES:

[1] S. Arnon, J. Barry, G. Karagiannidis, R. Schober, and M. Uysal, Advanced Optical Wireless Communication Systems, 1st ed. New York, NY, USA: Cambridge University Press, 2012.

[2] J. Salehi, “Code-division multiple access techniques in optical fiber networks, part 1. fundamental principles,” IEEE Trans. Commun., vol. 37, pp. 824–833, 1989.

[3] J. A. Salehi and C. A. Brackett, “Code division multiple-access techniques in optical fiber networks. ii. systems performance analysis,” IEEE Transactions on Communications, vol. 37, no. 8, pp. 834–842, Aug. 1989.

[4] E. Park, A. J. Mendez, and E. M. Garmire, “Temporal/spatial optical CDMA networksdesign, demonstration, and comparison with temporal networks,” IEEE Photonics Technology Letters, vol. 4, no. 10, pp. 1160–1162, Oct. 1992.

[5] A. J. Mendez and R. M. Gagliardi, “Code division multiple access (CDMA) enhancement of wavelength division multiplexing (WDM) systems,” in Proc. IEEE Int Communications ICC ’95 Seattle, ’Gateway to Globalization’ Conf, vol. 1, Jun. 1995, pp. 271–276 vol.1.

[6] T. Alderson and K. E. Mellinger, “Spreads, arcs, and multiple wavelength codes,” Discrete Mathematics, vol. 311, no. 13, pp. 1187 – 1196, 2011, selected Papers from the 22nd British Combinatorial Conference.

[7] W. Kwong and G.-C. Yang, “Extended carrierhopping prime codes for wavelength-time optical code-division multiple access,” IEEE Trans. Commun., vol. 52, no. 7, pp. 1084–1091, July 2004.

[8] R. Omrani and P. Vijay Kumar, “Improved constructions and bounds for 2-d optical orthogonal codes,” ISIT 2005, Proc. Int. Symp. Inf. Theory, pp. 127–131, Sept. 2005.

[9] R. M. Gagliardi and A. J. Mendez, “Performance improvement with hybrid wdm and cdma optical communications,” in Wavelength Division Multiplexing Components, L. S. Lome, Ed., vol. 2690. SPIE-Intl Soc Optical Eng, may 1996, pp. 88–96.

[10] E. Jugl and K. Iversen, “New combinatorial BER bounds for families of (0,1)-matrix codes,” in Global Telecommunications Conference, 1997. GLOBECOM ’97., vol. 3. IEEE, 1997, pp. 1543–1547.

[11] S. M. Johnson, “A new upper bound for errorcorrecting codes,” IRE Trans., vol. IT-8, pp. 203–207, 1962.

[12] E. Agrell, A. Vardy, and K. Zeger, “Upper bounds for constant-weight codes,” IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2373–2395, Nov. 2000.

[13] M. Svanstrom, “Ternary codes with weight con- ¨ straints,” Ph.D. thesis, Linkopings universitet, ¨ 1999, dissertation No. 572.

[14] R. Omrani, P. Elia, and P. V. Kumar, “New constructions and bounds for 2-d optical orthogonal codes.” in SETA, ser. Lecture Notes in Computer Science, T. Helleseth, D. V. Sarwate, H.-Y. Song, and K. Yang, Eds., vol. 3486. Springer, 2004, pp. 389–395.

[15] R. Omrani, G. Garg, P. V. Kumar, P. Elia, and P. Bhambhani, “Large families of asymptotically optimal two-dimensional optical orthogonal codes,” IEEE Transactions on Information Theory, vol. 58, no. 2, pp. 1163–1185, Feb. 2012.

[16] T. L. Alderson, “3-dimensional optical orthogonal codes with ideal autocorrelation—bounds and constructions,” manuscript, 2017.

[17] J. Ortiz-Ubarri, O. Moreno, and A. Tirkel, “Three-dimensional periodic optical orthogonal code for ocdma systems,” in Proc. IEEE Information Theory Workshop (ITW), Oct. 2011, pp. 170–174.

[18] K. W. Shum, “Optimal three-dimensional optical orthogonal codes of weight three,” Des. Codes Cryptogr., vol. 75, no. 1, pp. 109–126, 2015.

[19] S. Kim, K. Yu, and N. Park, “A new family of space/wavelength/time spread threedimensional optical code for ocdma networks,” Journal of Lightwave Technology, vol. 18, no. 4, pp. 502–511, Apr. 2000.

[20] X. Li, P. Fan, and K. W. Shum, “Construction of space/wavelength/time spread optical code with large family size,” IEEE Communications Letters, vol. 16, no. 6, pp. 893–896, Jun. 2012.

[21] F. R. K. Chung, J. A. Salehi, and V. K. Wei, “Optical orthogonal codes: design, analysis, and applications,” IEEE Trans. Inform. Theory, vol. 35, no. 3, pp. 595–604, 1989.

[22] T. L. Alderson, “Optical orthogonal codes and arcs in PG(d, q),” Finite Fields Appl., vol. 13, no. 4, pp. 762–768, 2007.

[23] N. Miyamoto, H. Mizuno, and S. Shinohara, “Optical orthogonal codes obtained from conics on finite projective planes,” Finite Fields Appl., vol. 10, no. 3, pp. 405–411, 2004.

[24] T. L. Alderson and K. E. Mellinger, “Constructions of optical orthogonal codes from finite geometry,” SIAM J. Discrete Math., vol. 21, no. 3, pp. 785–793 (electronic), 2007.

[25] ——, “Families of optimal OOCs with λ = 2,” Information Theory, IEEE Transactions on, vol. 54, no. 8, pp. 3722–3724, Aug. 2008.

[26] ——, “2-dimensional optical orthogonal codes from Singer groups,” Discrete Appl. Math., vol. 157, no. 14, pp. 3008–3019, 2009.

[27] C. R. Rao, “Cyclical generation of linear subspaces in finite geometries,” in Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina, Chapel Hill, N.C., 1967). Chapel Hill, N.C.: Univ. North Carolina Press, 1969, pp. 515–535.

[28] R. C. Bose, “An affine analogue of Singer’s theorem,” J. Indian Math. Soc. (N.S.), vol. 6, pp. 1–15, 1942.

[29] K. Drudge, “On the orbits of Singer groups and their subgroups,” Electron. J. Combin., vol. 9, no. 1, pp. Research Paper 15, 10 pp. (electronic), 2002.