New constructions and bounds for 2-D optical orthogonal codes

Lecture Notes in Computer Science

Volumn 3486, Issue , 2005, Pages 389-395

  Omrani, Reza ^a   Elia, Petros ^a   Kumar, P Vijay ^a  

^a University of Southern California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); WAVEGUIDES;

JOHNSON BOUND; MAXIMUM-DISTANCE SEPERABLE CODES; OPTICAL ORTHOGONAL CODES;

OPTICAL COMMUNICATION;

EID: 24944550818     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11423461_29     Document Type: Conference Paper

References (9)

1. S. M. Johnson:"A New Upper Bound for Error-Correcting Codes". IEEE Trans. Information Theory, Vol. 8, 203-207, April 1962
2. F. Chung, J. A. Salehi, and V. K. Wei:"Optical Orthogonal Codes: Design. Analysis, and Applications". IEEE Trans. Information Theory, Vol. 35, 596-604, May 1989
3. H. Chung and P. V. Kumar:"Optical Orthogonal Codes - New Bounds and an Optimal Construction". IEEE Trans. Information Theory, Vol. 36, 866-873, July 1990
4. O. Moreno, Z. Zhang, P. V. Kumar, and V. Zinoviev:"New Constructions of Optimal Cyclically Permutable Constant Weight Codes". IEEE Trans. Information Theory, Vol. 41, 448-455, March 1995
5. O. Moreno, P. V. Kumar, H. Lu, and R. Omrani:"New Construction of Optical orthogonal Codes, Distinct Difference Sets and Synchronous Optical orthogonal Codes". Proc. Int. Symposium on Information Theory, 2003
6. G. C. Yang, and W. C. Kwong:"Performance Comparison of Multiwavelength CDMA and WDMA+CDMA for Fiber-Optic Networks". IEEE Trans. Communications, Vol. 45, 1426-1434, Nov. 1997
7. R. Omrani, and P. V. Kumar:"2-D Optical orthogonal Codes". Proc. 41st Allerton Conf. Comm., Control, Comp., 2003
8. W. C. Kwong, and G. C. Yang:"Extended Carrier-Hopping Prime Codes for Wavelength-Time Optical Code-Division Multiple Access". IEEE Trans. Communications, Vol. 52, 1084-1091, July 2004
9. G. C. Yang, W. C. Kwong, and C. Y. Chang:"Multiple-Wavelength Optical Orthogonal Codes Under Prime-Sequence Permutations". Proc. Int. Symposium on Information Theory, 2004