Skip to main content
SpringerLink
Log in

Maximum two-dimensional (u × v, 4, 1, 3)-OOCs

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

Let Φ(u × v, k, λ a , λ c ) be the largest possible number of codewords among all two-dimensional (u × v, k, λ a , λ c ) optical orthogonal codes. A 2-D (u × v, k, λ a , λ c )-OOC with Φ(u × v, k, λ a , λ c ) codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D (u × v, 4, 1, 3)-OOC has been determined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R J R Abel, M Buratti. Some progress on (v, 4, 1) difference families and optical orthogonal codes, J Combin Theory Ser A, 2004, 106: 59–75.

    Article  MathSciNet  MATH  Google Scholar 

  2. T L Alderson, K E Mellinger. Geometric constructions of optimal optical orthogonal codes, Adv Math Commun, 2008, 2: 451–467.

    Article  MathSciNet  MATH  Google Scholar 

  3. T L Alderson, K E Mellinger. Families of optimal OOCs with λ = 2, IEEE Trans Inform Theory, 2008, 54: 3722–3724.

    Article  MathSciNet  Google Scholar 

  4. T L Alderson, K E Mellinger. 2-dimensional optical orthogonal codes from Singer groups, Discrete Appl Math, 2009, 157: 3008–3019.

    Article  MathSciNet  MATH  Google Scholar 

  5. M Buratti. Cyclic designs with block size 4 and related optimal optical orthogonal codes, Des Codes Cryptogr, 2002, 26: 111–125.

    Article  MathSciNet  MATH  Google Scholar 

  6. H Cao, R Wei. Combinatorial constructions for optimal two-dimensional optical orthogonal codes, IEEE Trans Inform Theory, 2009, 55: 1387–1394.

    Article  MathSciNet  Google Scholar 

  7. Y Chang, R Fuji-Hara, Y Miao. Combinatorial constructions of optimal optical orthogonal codes with weight 4, IEEE Trans Inform Theory, 2003, 49: 1283–1292.

    Article  MathSciNet  MATH  Google Scholar 

  8. Y Chang, L Ji. Optimal (4up, 5, 1) optical orthogonal codes, J Combin Des, 2004, 12: 346–361.

    Article  MathSciNet  MATH  Google Scholar 

  9. Y Chang, Y Miao. Constructions for optimal optical orthogonal codes, Discrete Math, 2003, 261: 127–139.

    Article  MathSciNet  MATH  Google Scholar 

  10. Y Chang, J Yin. Further results on optimal optical orthogonal codes with weight 4, Discrete Math, 2004, 279: 135–151.

    Article  MathSciNet  MATH  Google Scholar 

  11. W Chu, C J Colbourn. Optimal (v, 4, 2)-OOC of small orders, Discrete Math, 2004, 279: 163–172.

    Article  MathSciNet  MATH  Google Scholar 

  12. F R K Chung, J A Salehi, V K Wei. Optical orthogonal codes: design, analysis and applications, IEEE Trans Inform Theory, 1989, 35: 595–604.

    Article  MathSciNet  MATH  Google Scholar 

  13. T Feng, Y Chang, L Ji. Constructions for strictly cyclic 3-designs and applications to optimal OOCs with λ = 2, J Combin Theory Ser A, 2008, 115: 1527–1551.

    Article  MathSciNet  MATH  Google Scholar 

  14. Y Huang, Y Chang. Two classes of optimal two-dimensional OOCs, Des Codes Cryptogr, 2012, 63: 357–363.

    Article  MathSciNet  MATH  Google Scholar 

  15. Y Huang, Y Chang. Optimal (n, 4, λ, 3) optical orthogonal codes, Discrete Math, 2012, 312: 3128–3139.

    Article  MathSciNet  MATH  Google Scholar 

  16. Y Huang, J Zhou. A class of 2-dimensional optimal optical orthogonal codes with weight four, J Beijing Jiaotong Univ, 2012, 6: 144–146.

    Google Scholar 

  17. S Ma, Y Chang. A new class of optimal optical orthogonal codes with weight five, IEEE Trans Inform Theory, 2004, 50: 1848–1850.

    Article  MathSciNet  Google Scholar 

  18. S V Maric, O Moreno, C Corrada. Multimedia transmission in fiber-optic LANs using optical CDMA, J Lightwave Technol, 1996, 14: 2149–2153.

    Article  Google Scholar 

  19. K Momihara, M Buratti. Bounds and constructions of optimal (n, 4, 2, 1) optical orthogonal codes, IEEE Trans Inform Theory, 2009, 55: 514–523.

    Article  MathSciNet  Google Scholar 

  20. J A Salehi. Code division multiple-access techniques in optical fiber networks-Part I: Fundamental principles, IEEE T Commun, 1989, 37: 824–833.

    Article  Google Scholar 

  21. J A Salehi, C A Brackett. Code division multiple-access techniques in optical fiber networks-Part II: Systems performance analysis, IEEE T Commun, 1989, 37: 834–842.

    Article  Google Scholar 

  22. E S Shivaleela, A Selvarajan, T Srinivas. Two-dimensional optical orthogonal codes for fiber-optic CDMA networks, Lightwave Technol, 2005, 23: 647–654.

    Article  Google Scholar 

  23. J Wang, X Shan, J Yin. On constructions for optimal two-dimentional optical orthogonal codes, Des Codes Cryptogr, 2010, 54: 43–60.

    Article  MathSciNet  MATH  Google Scholar 

  24. X Wang, Y Chang. Further results on optimal (v, 4, 2, 1)-OOCs, Discrete Math, 2012, 28: 331–340.

    Article  MathSciNet  Google Scholar 

  25. J Yin. Some combinatorial constructions for optical orthogonal codes, Discrete Math, 1998, 185: 201–219.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Beijing Jiaotong University, Beijing, 100044, China

    Yue-mei Huang & Yan-xun Chang

  2. Mathematics Science college, Inner Mongolia Normal University, Hohhot, 010022, China

    Yue-mei Huang

Authors
  1. Yue-mei Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan-xun Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yue-mei Huang.

Additional information

Supported by the National Natural Science Foundation of China (61071221,10831002).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, Ym., Chang, Yx. Maximum two-dimensional (u × v, 4, 1, 3)-OOCs. Appl. Math. J. Chin. Univ. 28, 279–289 (2013). https://doi.org/10.1007/s11766-013-3064-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-013-3064-3

MR Subject Classification

Keywords

Search

Navigation