@COMMENT This file was generated by bib2html.pl <http://www.cs.cmu.edu/~pfr/misc_software/index.html#bib2html> version 0.91
@COMMENT written by Patrick Riley <http://www.cs.cmu.edu/~pfr>
@ARTICLE{chu03new,
 AUTHOR = {Wensong Chu and Solomon Golomb},
 TITLE = {A new recursive construction for optical orthogonal codes},
 JOURNAL = {IEEE Transactions on Information Theory},
 abstract={In this correspondence, we present a new recursive construction
     for ( ) optical orthogonal codes. For the case of (), this recursive construction will enlarge the
     original family with unchanged, and produce a new family of asymptotically optimal codes,
     if the original family is. We call a code asymptotically optimal, following
     the definition in [7], if, as , the length of code goes to infinity, the ratio of
     the number of codewords to the corresponding Johnson bound approaches unity.},
 VOLUME = 49,
 NUMBER = 11,
 PAGES = {3072-3076},
 YEAR = 2003,
 MONTH = nov,
 bib2html_pubtype = {Journal Articles},
 bib2html_rescat = {Generation Methods},
 bib2html_dl_pdf = "http://www.costasarrays.org/costasrefs/chu03new.pdf",
}