{"title":"基于循环差分族的最优变权光正交码","authors":"Hengchao Li, P. Fan, Dianhua Wu, P. Udaya","doi":"10.1109/ISIT.2009.5205754","DOIUrl":null,"url":null,"abstract":"Variable-weight optical orthogonal code (OOC) was introduced by G-C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, a construction for optimal variable-weight OOCs via cyclic difference families is given. Several new constructions for cyclic difference families are also given. By using these constructions, new optimal (n, W, 1, Q)-OOCs for 2 ¿ |W| ¿ 4 are constructed.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Optimal variable-weight optical orthogonal codes via cyclic difference families\",\"authors\":\"Hengchao Li, P. Fan, Dianhua Wu, P. Udaya\",\"doi\":\"10.1109/ISIT.2009.5205754\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Variable-weight optical orthogonal code (OOC) was introduced by G-C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, a construction for optimal variable-weight OOCs via cyclic difference families is given. Several new constructions for cyclic difference families are also given. By using these constructions, new optimal (n, W, 1, Q)-OOCs for 2 ¿ |W| ¿ 4 are constructed.\",\"PeriodicalId\":412925,\"journal\":{\"name\":\"2009 IEEE International Symposium on Information Theory\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2009.5205754\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2009.5205754","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal variable-weight optical orthogonal codes via cyclic difference families
Variable-weight optical orthogonal code (OOC) was introduced by G-C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, a construction for optimal variable-weight OOCs via cyclic difference families is given. Several new constructions for cyclic difference families are also given. By using these constructions, new optimal (n, W, 1, Q)-OOCs for 2 ¿ |W| ¿ 4 are constructed.