Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.citation.conferencePlace | KO | - |
| dc.citation.conferencePlace | Jeju | - |
| dc.citation.endPage | 132 | - |
| dc.citation.startPage | 129 | - |
| dc.citation.title | IEEE Information Theory Workshop (ITW 2015) | - |
| dc.contributor.author | Chung, Jin-Ho | - |
| dc.contributor.author | Yang, Kyeongcheol | - |
| dc.date.accessioned | 2023-12-19T21:41:29Z | - |
| dc.date.available | 2023-12-19T21:41:29Z | - |
| dc.date.created | 2016-01-13 | - |
| dc.date.issued | 2015-10-13 | - |
| dc.description.abstract | An optical orthogonal code (OOC) of length N is a set of {0, 1}-sequences of length N, all of which have a constant weight. It is employed as a spreading code in optical communication systems, where 1 means signal 'on' and 0 signal 'off.' In this paper, we present a generic construction of OOCs of length (q-1)N from an OOC of length N, where q is a prime power with gcd(q -1,N) = 1. This construction can be applied to any OOCs with maximum correlation value 1 and weight less than or equal to q. As a result, a new family of asymptotically optimal OOCs with respect to the Johnson bound can be obtained from an optimal OOC with maximum correlation value 1. | - |
| dc.identifier.bibliographicCitation | IEEE Information Theory Workshop (ITW 2015), pp.129 - 132 | - |
| dc.identifier.doi | 10.1109/ITWF.2015.7360748 | - |
| dc.identifier.scopusid | 2-s2.0-84962764888 | - |
| dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/35476 | - |
| dc.identifier.url | https://ieeexplore.ieee.org/document/7360748 | - |
| dc.language | 영어 | - |
| dc.publisher | IEEE Information Theory Society | - |
| dc.title | New construction of asymptotically optimal optical orthogonal codes | - |
| dc.type | Conference Paper | - |
| dc.date.conferenceDate | 2015-10-11 | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.