• Sorted by Date • Classified by Publication Type • Classified by Research Category • Classified by Author Last Name •
Wensong Chu and Solomon Golomb. A new recursive construction for optical orthogonal codes. IEEE Transactions on Information Theory, 49(11):3072–3076, November 2003.
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.
@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",
}
Generated by bib2html.pl (written by Patrick Riley ) on Thu Oct 06, 2011 11:31:00