Abstract
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 lambda =2. The parameters (n, omega , lambda ) are respectively (p/sup 2m/-1, p/sup m/+1,2), where p is any prime and the family size is p/sup m/-2. Three distinct upper bounds on the size of an OOC are presented that, for many values of the parameter set (n, omega , lambda ), improve upon the tightest previously known bound. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
