Skip to main content

New Constructions and Bounds for 2-D Optical Orthogonal Codes

  • Conference paper
Book cover Sequences and Their Applications - SETA 2004 (SETA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3486))

Included in the following conference series:

Abstract

Some efficient constructions and bounds for 2-D optical orthogonal codes in which the spreading is carried out over both wavelength and time are provided. Such codes are of current practical interest as they enable optical communication at lower chip rate.

The bounds provided include 2-D versions of the Johnson bound as well as a novel bound that makes use of the properties of a maximum-distance separable codes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Johnson, S.M.: A New Upper Bound for Error-Correcting Codes. IEEE Trans. Information Theory 8, 203–207 (1962)

    Article  Google Scholar 

  2. Chung, F., Salehi, J.A., Wei, V.K.: Optical Orthogonal Codes: Design. Analysis, and Applications. IEEE Trans. Information Theory 35, 596–604 (1989)

    MathSciNet  Google Scholar 

  3. Chung, H., Kumar, P.V.: Optical Orthogonal Codes - New Bounds and an Optimal Construction. IEEE Trans. Information Theory 36, 866–873 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Moreno, O., Zhang, Z., Kumar, P.V., Zinoviev, V.: New Constructions of Optimal Cyclically Permutable Constant Weight Codes. IEEE Trans. Information Theory 41, 448–455 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Moreno, O., Kumar, P.V., Lu, H., Omrani, R.: New Construction of Optical orthogonal Codes, Distinct Difference Sets and Synchronous Optical orthogonal Codes. In: Proc. Int. Symposium on Information Theory (2003)

    Google Scholar 

  6. Yang, G.C., Kwong, W.C.: Performance Comparison of Multiwavelength CDMA and WDMA+CDMA for Fiber-Optic Networks. IEEE Trans. Communications 45, 1426–1434 (1997)

    Article  Google Scholar 

  7. Omrani, R., Kumar, P.V.: 2-D Optical orthogonal Codes. In: Proc. 41st Allerton Conf. Comm., Control, Comp. (2003)

    Google Scholar 

  8. Kwong, W.C., Yang, G.C.: Extended Carrier-Hopping Prime Codes for Wavelength-Time Optical Code-Division Multiple Access. IEEE Trans. Communications 52, 1084–1091 (2004)

    Article  Google Scholar 

  9. Yang, G.C., Kwong, W.C., Chang, C.Y.: Multiple-Wavelength Optical Orthogonal Codes Under Prime-Sequence Permutations. In: Proc. Int. Symposium on Information Theory (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Omrani, R., Elia, P., Kumar, P.V. (2005). New Constructions and Bounds for 2-D Optical Orthogonal Codes. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_29

Download citation

  • DOI: https://doi.org/10.1007/11423461_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26084-4

  • Online ISBN: 978-3-540-32048-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics