光正交码、循环置换码和超光正交码

S. Martirosyan, A. Vinck, A. Harutyunyan
{"title":"光正交码、循环置换码和超光正交码","authors":"S. Martirosyan, A. Vinck, A. Harutyunyan","doi":"10.1109/ISIT.2007.4557579","DOIUrl":null,"url":null,"abstract":"Optical orthogonal codes (OOC) are special classes of codes for applications in code division multi-access (CDMA) transmission using an optical carrier. We show a new relationship between constant weight cyclically permutable codes (CPC) and OOC's which can be investigated further. The main result ties together the CPC's and the solution of an algebraic system of congruences. For a particular case, there is a recurrence relationship for the code cardinality. More general cases need to be elaborated in coming research. We discuss also so-called super OOC's, which are codes with stronger correlation properties, and show several examples of such codes derivable from CPC's designed by applying the method proposed.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Optical Orthogonal, Cyclically Permutable, and Super Optical Orthogonal Codes\",\"authors\":\"S. Martirosyan, A. Vinck, A. Harutyunyan\",\"doi\":\"10.1109/ISIT.2007.4557579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optical orthogonal codes (OOC) are special classes of codes for applications in code division multi-access (CDMA) transmission using an optical carrier. We show a new relationship between constant weight cyclically permutable codes (CPC) and OOC's which can be investigated further. The main result ties together the CPC's and the solution of an algebraic system of congruences. For a particular case, there is a recurrence relationship for the code cardinality. More general cases need to be elaborated in coming research. We discuss also so-called super OOC's, which are codes with stronger correlation properties, and show several examples of such codes derivable from CPC's designed by applying the method proposed.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2007.4557579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

光正交码(OOC)是利用光载波进行码分多址(CDMA)传输的一种特殊编码。我们提出了恒权循环可变码(CPC)和OOC之间的新关系,该关系可以进一步研究。主要结果将CPC的解和一个代数系统的同余解联系在一起。对于特定情况,代码基数存在递归关系。在未来的研究中需要详细阐述更多的一般案例。我们还讨论了所谓的超级OOC码,即具有较强相关性的码,并给出了应用该方法设计的CPC码衍生出这种码的几个例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Optical Orthogonal, Cyclically Permutable, and Super Optical Orthogonal Codes
Optical orthogonal codes (OOC) are special classes of codes for applications in code division multi-access (CDMA) transmission using an optical carrier. We show a new relationship between constant weight cyclically permutable codes (CPC) and OOC's which can be investigated further. The main result ties together the CPC's and the solution of an algebraic system of congruences. For a particular case, there is a recurrence relationship for the code cardinality. More general cases need to be elaborated in coming research. We discuss also so-called super OOC's, which are codes with stronger correlation properties, and show several examples of such codes derivable from CPC's designed by applying the method proposed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信