期刊文献+

The combinatorial construction for a class of optimal optical orthogonal codes 被引量:1

The combinatorial construction for a class of optimal optical orthogonal codes
原文传递
导出
摘要 Optical orthogonal code (OOC) has good correlation properties. It has many important appli-cations in a fiber-optic code-division multiple access channel. In this paper, a combinatorial construction foroptimal (15p, 5, 1) optical orthogonal codes with p congruent to 1 modulo 4 and greater than 5 is given byapplying Weil's Theorem. From this, when v is a product of primes congruent to 1 modulo 4 and greater than5, an optimal (15v, 5, 1)-OOC can be obtained by applying a known recursive construction. Optical orthogonal code (OOC) has good correlation properties. It has many important applications in a fiber-optic code-division multiple access channel. In this paper, a combinatorial construction for optimal(15p, 5,1) optical orthogonal codes withp congruent to 1 modulo 4 and greater than 5 is given by applying Weil's Theorem. From this, whenv is a product of primes congruent to 1 modulo 4 and greater than 5, an optimal (15v, 5, 1)-OOC can be obtained by applying a known recursive construction.
作者 唐煜 殷剑兴
出处 《Science China Mathematics》 SCIE 2002年第10期1268-1275,共8页 中国科学:数学(英文版)
基金 This work was supported by the National Natural Science Foundation of China (Grant No. 10071056).
关键词 CODE-DIVISION multiple access optical ORTHOGONAL codes combinatorial construction. code-division multiple access optical orthogonal codes combinatorial construction
  • 相关文献

参考文献1

同被引文献16

  • 1Jie Yan,Jianxing Yin.A class of optimal constant composition codes from GDRPs[J]. Designs, Codes and Cryptography . 2009 (1)
  • 2Jianxing Yin,Jie Yan,Chengmin Wang.Generalized balanced tournament designs and related codes[J]. Designs, Codes and Cryptography . 2008 (2)
  • 3Tang Yu,Yin Jianxing.The combinatorial construction for a class of optimal optical orthogonal codes[J]. Science in China Series A: Mathematics . 2002 (10)
  • 4Gelling E N,Odeh R E.On 1-factorizations of the complete graph and the relationship to round robin schedules. Congressus Numerantium . 1974
  • 5The CRC Handbook of Combinatorial Designs. . 2006
  • 6Lamken,E.R.On near generalized balanced tournament designs. Discrete Mathematics . 1991
  • 7Yan J.Generalized doubly resolvable packings and the corresponding codes. . 2007
  • 8R.M. Wilson.Cyclotomy and difference families in elementary abelian groups. Journal of Number Theory . 1972
  • 9Yan J,Yin J.1</sup>μ<sup>m-1</sup>&amp;sid=Discrete Applied Mathematics&amp;aufirst=Yan J');&#xA; ">Constructions of optimal GDRP(n,λ;v)‘s of typeλ<sup>1</sup>μ<sup>m-1</sup>. Discrete Applied Mathematics . 2008
  • 10Yin J,Yan J,Wang C.Generalized balanced tournament designs of block size4. Designs Codes and Cryptography . 2008

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部