• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >New Constructions of Optimal Optical Orthogonal Codes Based on Partitionable Sets and Almost Partitionable Sets
【24h】

New Constructions of Optimal Optical Orthogonal Codes Based on Partitionable Sets and Almost Partitionable Sets

机译：New Constructions of Optimal Optical Orthogonal Codes Based on Partitionable Sets and Almost Partitionable Sets

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

Variable-weight optical orthogonal codes (OOCs) were introduced by Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. In this paper, partitionable sets and almost partitionable sets are used to construct variable-weight OOCs. Four new recursive constructions for optimal cyclic packing are presented. Consequently, new infinite classes of optimal $(v,W,1,Q)$ -OOCs are obtained.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号