By Topic

Optical orthogonal codes-new bounds and an optimal construction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chung, H. ; Dept. of Electr. & Comput.Eng., State Univ. of New York, Buffalo, NY, USA ; Kumar, P.V.

A technique for constructing optimal OOCs (optical orthogonal codes) is presented. It provides the only known family of optimal (with respect to family size) OOCs having λ=2. The parameters (n ,ω,λ) are respectively (p2m-1, pm+1,2), where p is any prime and the family size is pm-2. Three distinct upper bounds on the size of an OOC are presented that, for many values of the parameter set (n,ω,λ), improve upon the tightest previously known bound

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 4 )