Please use this identifier to cite or link to this item:
http://nopr.niscpr.res.in/handle/123456789/22334Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kar, S | - |
| dc.contributor.author | Mehta, R | - |
| dc.contributor.author | Shah, L | - |
| dc.date.accessioned | 2013-10-19T07:40:01Z | - |
| dc.date.available | 2013-10-19T07:40:01Z | - |
| dc.date.issued | 1999-10 | - |
| dc.identifier.issn | 0975-1017 (Online); 0971-4588 (Print) | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/22334 | - |
| dc.description | 289-291 | en_US |
| dc.description.abstract | A (n,w,λ)-optical orthogonal code(OOC) is a family of (0,1) sequences of length n and constant Hamming weight w that have both out-of phase auto-correlation and cross-correlation not exceeding λ. We discuss the optimal codes for λ=2. Some of the new generated codes for large number of users are presented. The algorithm to develop those codes and some generalizations are also given. Some very large size codes generated by using projective geometry are tabulated and methods for fast generation of the codes are also discussed. | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | NISCAIR-CSIR, India | en_US |
| dc.rights |  CC Attribution-Noncommercial-No Derivative Works 2.5 India | en_US |
| dc.source | IJEMS Vol.06(5) [October 1999] | en_US |
| dc.title | Reducing generation times for large optical orthogonal codes | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | IJEMS Vol.06(5) [October 1999] | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| IJEMS 6(5) 289-291.pdf | 660.51 kB | Adobe PDF | View/Open |
Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.