Skip to main content
Springer Nature Link
Log in

Topics on Optical Orthogonal Codes

  • Conference paper
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:

  • 809 Accesses

Abstract

Recently, there has been an upsurge of interest in using Code-Division Multiple-Access communication over optical fiber channels (OCDMA). In this paper we provide a new Johnson-bound-optimal construction of OOC with parameter λ = 1. We use the idea of the same construction to generate OOCs with λ > 1. A new bound for optical orthogonal codes based on a known bound for constant weight codes is introduced. This bound is used to prove the optimality of our constructions. We also present a recursive technique for generating OOCs with λ = 1 that makes use of a recursive construction for cyclic block designs by Colbourn and Colbourn [1]. This technique has yielded several new optimal constructions for Optical Orthogonal Codes.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Colbourn, M.J., Colbourn, C.J.: Recursive Constructions for Cyclic Block Designs. Journal of Statistical Planning and Inference 10, 97–103 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  2. Salehi, J.A.: Code Division Multiple-Access Techniques in Optical Fiber Networks- Part I: Fundamental Principles. IEEE Trans. Communications 37, 824–833 (1989)

    Article  Google Scholar 

  3. 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 

  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. 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 

  7. Agrell, E., Vardy, A., Zeger, K.: Upper Bounds for Constant-Weight Codes. IEEE Trans. Information Theory 46, 2373–2395 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lin, S., Costello, D.J.: Error Control Coding: Fundamentals and Applications. Prentice-Hall, Inc., Englewood Cliffs (1983)

    Google Scholar 

  9. Rao, C.R.: Cyclical Generation of Linear Subspaces in Finite Geometries. In: Proc. Combinatorial Mathematics and its Applications, pp. 515–535 (1969)

    Google Scholar 

  10. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, New York (1977)

    MATH  Google Scholar 

  11. Bose, R.C., Chowla, S.: On the Construction of Affine Difference Sets. Bull. Calcutta Math. Soc. 37, 107–112 (1945)

    MATH  MathSciNet  Google Scholar 

  12. Moreno, O., Omrani, R., Kumar, P.V., Lu, H.: New Construction for Optical Orthogonal Codes, and Distinct Difference Sets. Submitted to IEEE Trans. Information Theory

    Google Scholar 

  13. Omrani, R., Moreno, O., Kumar, P.V.: Optimal Optical Orthogonal Codes with λ> 1. In: Proc. Int. Symposium on Information Theory (2004)

    Google Scholar 

  14. Moreno, O., Omrani, R., Kumar, P.V.: Optimal Optical Orthogonal Codes with λ> 1. CSI Publication, CSI-04-09-01, to be submitted to IEEE Trans. Information Theory

    Google Scholar 

  15. Elliott, J.E.H., Butson, A.T.: Relative Difference Sets. Illinois Journal of Mathematics 10, 517–531 (1966)

    MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  17. Zhi, C., Pingzhi, F., Fan, J.: Disjoint Difference Sets, Difference Triangle Sets and Related Codes. IEEE Trans. Information Theory 38, 518–522 (1992)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Communication Sciences Institute, Department of Electrical Engineering – Systems, University of Southern California, 3740 McClintock Ave., Los Angeles, CA, 90089-2565, USA

    Reza Omrani & P. Vijay Kumar

  2. Gauss Research Lab, University of Puerto Rico, PO Box 23334, San Juan, Puerto Rico, PR 00931-3334

    Oscar Moreno

Authors
  1. Reza Omrani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oscar Moreno
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Vijay Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

  2. University of Ilinois at Urbana-Champaign, 1406 West Green Street, IL 61801, Urbana, USA

    Dilip Sarwate

  3. Department of Electrical and Electronic Engineering, Yonsei University, 121-749, Seoul, Korea

    Hong-Yeop Song

  4. Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    Kyeongcheol Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Omrani, R., Moreno, O., Kumar, P.V. (2005). Topics on 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_30

Download citation

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

  • 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