WEKO3
アイテム
Optical Orthogonal Signature Pattern Codes with Maximum Collision Parameter 2 and Weight 4
http://hdl.handle.net/2237/14501
http://hdl.handle.net/2237/145014c9ef590-d8b8-4f73-a8eb-42d11f5e2acf
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
sawa_nagoya-repos.pdf (167.1 kB)
|
|
| アイテムタイプ | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2011-03-02 | |||||
| タイトル | ||||||
| タイトル | Optical Orthogonal Signature Pattern Codes with Maximum Collision Parameter 2 and Weight 4 | |||||
| 言語 | en | |||||
| 著者 |
Sawa, Masanori
× Sawa, Masanori |
|||||
| アクセス権 | ||||||
| アクセス権 | open access | |||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
| 権利 | ||||||
| 権利情報 | ©2010 IEEE. Reprinted, with permission, from Sawa, M.; , "Optical Orthogonal Signature Pattern Codes With Maximum Collision Parameter 2 and Weight 4 ," Information Theory, IEEE Transactions on , vol.56, no.7, pp.3613-3620, July 2010 | |||||
| 言語 | en | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | Automorphism group | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | H-design | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | packing design | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | optical orthogonal code | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | optical orthogonal signature pattern code | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | space code division multiple access | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | An optical orthogonal signature pattern code (OOSPC) finds application in transmitting 2-D images through multicore fiber in code-division multiple-access (CDMA) communication systems. Observing a one-to-one correspondence between an OOSPC and a certain combinatorial subject, called a packing design, we present a construction of optimal OOSPCs with weight 4 and maximum collision parameter 2, which generalizes a well-known Köhler construction of optimal optical orthogonal codes (OOC) with weight 4 and maximum collision parameter 2. Using this new construction enables one to obtain infinitely many optimal OOSPCs, whose existence was previously unknown. We prove that for a multiple n of 4, there exists no optimal OOSPC of size 6 n with weight 4 and maximum collision parameter 2, together with a report which shows a gap between optimal OOCs and optimal OOSPCs when 6 and n are not coprime. We also present a recursive construction of OOSPCs which are asymptotically optimal with respect to the Johnson bound. As a by-product, we obtain an asymptotically optimal (m, n, 4, 2)-OOSPC for all positive integers m and n. | |||||
| 言語 | en | |||||
| 出版者 | ||||||
| 出版者 | IEEE | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
| タイプ | journal article | |||||
| 出版タイプ | ||||||
| 出版タイプ | AM | |||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||
| DOI | ||||||
| 関連タイプ | isVersionOf | |||||
| 識別子タイプ | DOI | |||||
| 関連識別子 | https://doi.org/10.1109/TIT.2010.2048487 | |||||
| ISSN | ||||||
| 収録物識別子タイプ | PISSN | |||||
| 収録物識別子 | 0018-9448 | |||||
| 書誌情報 |
en : IEEE Transactions on Information Theory 巻 56, 号 7, p. 3613-3620, 発行日 2010-07 |
|||||
| 著者版フラグ | ||||||
| 値 | author | |||||
| URI | ||||||
| 識別子 | http://hdl.handle.net/2237/14501 | |||||
| 識別子タイプ | HDL | |||||
| URI | ||||||
| 識別子 | http://dx.doi.org/10.1109/TIT.2010.2048487 | |||||
| 識別子タイプ | DOI | |||||
