November  2008, 2(4): 451-467. doi: 10.3934/amc.2008.2.451

Geometric constructions of optimal optical orthogonal codes

1. 

Department of Mathematical Sciences, University of New Brunswick Saint John, New Brunswick, E2L 4L5, Canada

2. 

Department of Mathematics, University of Mary Washington, 1301 College Avenue, Trinkle Hall, Fredericksburg, VA 22401, United States

Received  July 2008 Revised  September 2008 Published  November 2008

We provide a variety of constructions of $(n, w, \lambda)$-optical orthogonal codes using special sets of points and Singer groups in finite projective spaces. In several of the constructions, we are able to prove that the resulting codes are optimal with respect to the Johnson bound. The optimal codes exhibited have $\lambda = 1, 2$ and $w-1$ (where $w$ is the weight of each codeword in the code). The remaining constructions are are shown to be asymptotically optimal with respect to the Johnson bound, and in some cases maximal. These codes represent an improvement upon previously known codes by shortening the length. In some cases the constructions give rise to variable weight OOCs.
Citation: T. L. Alderson, K. E. Mellinger. Geometric constructions of optimal optical orthogonal codes. Advances in Mathematics of Communications, 2008, 2 (4) : 451-467. doi: 10.3934/amc.2008.2.451
[1]

Cuiling Fan, Koji Momihara. Unified combinatorial constructions of optimal optical orthogonal codes. Advances in Mathematics of Communications, 2014, 8 (1) : 53-66. doi: 10.3934/amc.2014.8.53

[2]

Chunlei Xie, Yujuan Sun. Construction and assignment of orthogonal sequences and zero correlation zone sequences for applications in CDMA systems. Advances in Mathematics of Communications, 2020, 14 (1) : 1-9. doi: 10.3934/amc.2020001

[3]

Huangsheng Yu, Dianhua Wu, Jinhua Wang. New optimal $(v, \{3,5\}, 1, Q)$ optical orthogonal codes. Advances in Mathematics of Communications, 2016, 10 (4) : 811-823. doi: 10.3934/amc.2016042

[4]

Kailu Yang, Xiaomiao Wang, Menglong Zhang, Lidong Wang. Some progress on optimal $ 2 $-D $ (n\times m,3,2,1) $-optical orthogonal codes. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021012

[5]

María Chara, Ricardo A. Podestá, Ricardo Toledano. The conorm code of an AG-code. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021018

[6]

Laura Luzzi, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore. Algebraic reduction for the Golden Code. Advances in Mathematics of Communications, 2012, 6 (1) : 1-26. doi: 10.3934/amc.2012.6.1

[7]

Irene Márquez-Corbella, Edgar Martínez-Moro, Emilio Suárez-Canedo. On the ideal associated to a linear code. Advances in Mathematics of Communications, 2016, 10 (2) : 229-254. doi: 10.3934/amc.2016003

[8]

Serhii Dyshko. On extendability of additive code isometries. Advances in Mathematics of Communications, 2016, 10 (1) : 45-52. doi: 10.3934/amc.2016.10.45

[9]

Daniel Grieser. A natural differential operator on conic spaces. Conference Publications, 2011, 2011 (Special) : 568-577. doi: 10.3934/proc.2011.2011.568

[10]

Santanu Sarkar, Subhamoy Maitra. Some applications of lattice based root finding techniques. Advances in Mathematics of Communications, 2010, 4 (4) : 519-531. doi: 10.3934/amc.2010.4.519

[11]

Vincenzo Ambrosio, Giovanni Molica Bisci, Dušan Repovš. Nonlinear equations involving the square root of the Laplacian. Discrete & Continuous Dynamical Systems - S, 2019, 12 (2) : 151-170. doi: 10.3934/dcdss.2019011

[12]

Elena Shchepakina, Olga Korotkova. Canard explosion in chemical and optical systems. Discrete & Continuous Dynamical Systems - B, 2013, 18 (2) : 495-512. doi: 10.3934/dcdsb.2013.18.495

[13]

Guangzhou Chen, Xiaotong Zhang. Constructions of irredundant orthogonal arrays. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021051

[14]

Gurkan Ozturk, Mehmet Tahir Ciftci. Clustering based polyhedral conic functions algorithm in classification. Journal of Industrial & Management Optimization, 2015, 11 (3) : 921-932. doi: 10.3934/jimo.2015.11.921

[15]

Lenny Fukshansky, Ahmad A. Shaar. A new family of one-coincidence sets of sequences with dispersed elements for frequency hopping cdma systems. Advances in Mathematics of Communications, 2018, 12 (1) : 181-188. doi: 10.3934/amc.2018012

[16]

Sergio R. López-Permouth, Steve Szabo. On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings. Advances in Mathematics of Communications, 2009, 3 (4) : 409-420. doi: 10.3934/amc.2009.3.409

[17]

Yan Liu, Minjia Shi, Hai Q. Dinh, Songsak Sriboonchitta. Repeated-root constacyclic codes of length $ 3\ell^mp^s $. Advances in Mathematics of Communications, 2020, 14 (2) : 359-378. doi: 10.3934/amc.2020025

[18]

Partha Sharathi Dutta, Soumitro Banerjee. Period increment cascades in a discontinuous map with square-root singularity. Discrete & Continuous Dynamical Systems - B, 2010, 14 (3) : 961-976. doi: 10.3934/dcdsb.2010.14.961

[19]

Tingting Wu, Shixin Zhu, Li Liu, Lanqiang Li. Repeated-root constacyclic codes of length 6lmpn. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021044

[20]

Theresa Lange, Wilhelm Stannat. Mean field limit of Ensemble Square Root filters - discrete and continuous time. Foundations of Data Science, 2021, 3 (3) : 563-588. doi: 10.3934/fods.2021003

2020 Impact Factor: 0.935

Metrics

  • PDF downloads (83)
  • HTML views (0)
  • Cited by (16)

Other articles
by authors

[Back to Top]