最优$ 2 $-D $ (n\乘以m,3,2,1) $-光学正交码的研究进展

IF 0.7 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Advances in Mathematics of Communications Pub Date : 2023-01-01 DOI:10.3934/AMC.2021012

Kailu Yang, Xiaomiao Wang, Menglong Zhang, Lidong Wang

{"title":"最优$ 2 $-D $ (n\\乘以m,3,2,1) $-光学正交码的研究进展","authors":"Kailu Yang, Xiaomiao Wang, Menglong Zhang, Lidong Wang","doi":"10.3934/AMC.2021012","DOIUrl":null,"url":null,"abstract":"In this paper, we are concerned about bounds and constructions of optimal \\begin{document}$ 2 $\\end{document} -D \\begin{document}$ (n\\times m,3,2,1) $\\end{document} -optical orthogonal codes. The exact number of codewords of an optimal \\begin{document}$ 2 $\\end{document} -D \\begin{document}$ (n\\times m,3,2,1) $\\end{document} -optical orthogonal code is determined for \\begin{document}$ n = 2 $\\end{document} , \\begin{document}$ m\\equiv 1 \\pmod{2} $\\end{document} , and \\begin{document}$ n\\equiv 1 \\pmod{2} $\\end{document} , \\begin{document}$ m\\equiv 1,3,5 \\pmod{12} $\\end{document} , and \\begin{document}$ n\\equiv 4 \\pmod{6} $\\end{document} , \\begin{document}$ m\\equiv 8 \\pmod{16} $\\end{document} .","PeriodicalId":50859,"journal":{"name":"Advances in Mathematics of Communications","volume":"2016 1","pages":"605-625"},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some progress on optimal $ 2 $-D $ (n\\\\times m,3,2,1) $-optical orthogonal codes\",\"authors\":\"Kailu Yang, Xiaomiao Wang, Menglong Zhang, Lidong Wang\",\"doi\":\"10.3934/AMC.2021012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we are concerned about bounds and constructions of optimal \\\\begin{document}$ 2 $\\\\end{document} -D \\\\begin{document}$ (n\\\\times m,3,2,1) $\\\\end{document} -optical orthogonal codes. The exact number of codewords of an optimal \\\\begin{document}$ 2 $\\\\end{document} -D \\\\begin{document}$ (n\\\\times m,3,2,1) $\\\\end{document} -optical orthogonal code is determined for \\\\begin{document}$ n = 2 $\\\\end{document} , \\\\begin{document}$ m\\\\equiv 1 \\\\pmod{2} $\\\\end{document} , and \\\\begin{document}$ n\\\\equiv 1 \\\\pmod{2} $\\\\end{document} , \\\\begin{document}$ m\\\\equiv 1,3,5 \\\\pmod{12} $\\\\end{document} , and \\\\begin{document}$ n\\\\equiv 4 \\\\pmod{6} $\\\\end{document} , \\\\begin{document}$ m\\\\equiv 8 \\\\pmod{16} $\\\\end{document} .\",\"PeriodicalId\":50859,\"journal\":{\"name\":\"Advances in Mathematics of Communications\",\"volume\":\"2016 1\",\"pages\":\"605-625\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Mathematics of Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3934/AMC.2021012\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Mathematics of Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3934/AMC.2021012","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

In this paper, we are concerned about bounds and constructions of optimal \begin{document}$ 2 $\end{document} -D \begin{document}$ (n\times m,3,2,1) $\end{document} -optical orthogonal codes. The exact number of codewords of an optimal \begin{document}$ 2 $\end{document} -D \begin{document}$ (n\times m,3,2,1) $\end{document} -optical orthogonal code is determined for \begin{document}$ n = 2 $\end{document} , \begin{document}$ m\equiv 1 \pmod{2} $\end{document} , and \begin{document}$ n\equiv 1 \pmod{2} $\end{document} , \begin{document}$ m\equiv 1,3,5 \pmod{12} $\end{document} , and \begin{document}$ n\equiv 4 \pmod{6} $\end{document} , \begin{document}$ m\equiv 8 \pmod{16} $\end{document} .

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Some progress on optimal $ 2 $-D $ (n\times m,3,2,1) $-optical orthogonal codes

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Advances in Mathematics of Communications 工程技术-计算机：理论方法

CiteScore

2.20

自引率

22.20%

发文量

审稿时长

>12 weeks

期刊介绍： Advances in Mathematics of Communications (AMC) publishes original research papers of the highest quality in all areas of mathematics and computer science which are relevant to applications in communications technology. For this reason, submissions from many areas of mathematics are invited, provided these show a high level of originality, new techniques, an innovative approach, novel methodologies, or otherwise a high level of depth and sophistication. Any work that does not conform to these standards will be rejected. Areas covered include coding theory, cryptology, combinatorics, finite geometry, algebra and number theory, but are not restricted to these. This journal also aims to cover the algorithmic and computational aspects of these disciplines. Hence, all mathematics and computer science contributions of appropriate depth and relevance to the above mentioned applications in communications technology are welcome. More detailed indication of the journal''s scope is given by the subject interests of the members of the board of editors.