By Topic

A new recursive construction for optical orthogonal codes

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)
Chu, W. ; Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA ; Golomb, S.W.

We present a new recursive construction for (n,ω,λac) optical orthogonal codes. For the case of λa = λc = λ, this recursive construction enlarges the original family with λ unchanged, and produces a new family of asymptotically optimal codes, if the original family is asymptotically optimal. We call a code asymptotically optimal, following the definition of O. Moreno et al. (see ibid., vol.41, p.448-55, 1995), if, as n, the length of code, goes to infinity, the ratio of the number of codewords to the corresponding Johnson bound approaches unity.

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 11 )