长度非2次幂序列互补集的新构造

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI:10.1587/transfun.2023eal2073

Longye WANG, Houshan LIU, Xiaoli ZENG, Qingping YU

{"title":"长度非2次幂序列互补集的新构造","authors":"Longye WANG, Houshan LIU, Xiaoli ZENG, Qingping YU","doi":"10.1587/transfun.2023eal2073","DOIUrl":null,"url":null,"abstract":"This letter presented several new constructions of complementary sets (CSs) with flexible sequence lengths using matrix transformations. The constructed CSs of size 4 have different lengths, namely N + L and 2N + L, where N and L are the lengths for which complementary pairs exist. Also, presented CSs of size 8 have lengths N + P, P + Q and 2P + Q, where N is length of complementary pairs, P and Q are lengths of CSs of size 4 exist. The achieved designs can be easily extended to a set size of 2n+2 by recursive method. The proposed constructions generalize some previously reported constructions along with generating CSs under fewer constraints.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Novel Constructions of Complementary Sets of Sequences of Lengths Non-Power-of-Two\",\"authors\":\"Longye WANG, Houshan LIU, Xiaoli ZENG, Qingping YU\",\"doi\":\"10.1587/transfun.2023eal2073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This letter presented several new constructions of complementary sets (CSs) with flexible sequence lengths using matrix transformations. The constructed CSs of size 4 have different lengths, namely N + L and 2N + L, where N and L are the lengths for which complementary pairs exist. Also, presented CSs of size 8 have lengths N + P, P + Q and 2P + Q, where N is length of complementary pairs, P and Q are lengths of CSs of size 4 exist. The achieved designs can be easily extended to a set size of 2n+2 by recursive method. The proposed constructions generalize some previously reported constructions along with generating CSs under fewer constraints.\",\"PeriodicalId\":55003,\"journal\":{\"name\":\"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1587/transfun.2023eal2073\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1587/transfun.2023eal2073","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

摘要

本文利用矩阵变换提出了几种具有灵活序列长度的互补集的新构造。构建的大小为4的CSs具有不同的长度，即N + L和2N + L，其中N和L为互补对存在的长度。所提出的大小为8的CSs的长度分别为N + P、P + Q和2P + Q，其中N为互补对的长度，P和Q为大小为4的CSs的长度。所实现的设计可以很容易地通过递归方法扩展到2n+2的集合大小。提出的结构概括了以前报道的一些结构，并在更少的约束下生成CSs。

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

查看原文本刊更多论文

Novel Constructions of Complementary Sets of Sequences of Lengths Non-Power-of-Two

This letter presented several new constructions of complementary sets (CSs) with flexible sequence lengths using matrix transformations. The constructed CSs of size 4 have different lengths, namely N + L and 2N + L, where N and L are the lengths for which complementary pairs exist. Also, presented CSs of size 8 have lengths N + P, P + Q and 2P + Q, where N is length of complementary pairs, P and Q are lengths of CSs of size 4 exist. The achieved designs can be easily extended to a set size of 2n+2 by recursive method. The proposed constructions generalize some previously reported constructions along with generating CSs under fewer constraints.

求助全文

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

来源期刊

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences 工程技术-工程：电子与电气

CiteScore

1.10

自引率

20.00%

发文量

137

审稿时长

3.9 months

期刊介绍： Includes reports on research, developments, and examinations performed by the Society''s members for the specific fields shown in the category list such as detailed below, the contents of which may advance the development of science and industry: (1) Reports on new theories, experiments with new contents, or extensions of and supplements to conventional theories and experiments. (2) Reports on development of measurement technology and various applied technologies. (3) Reports on the planning, design, manufacture, testing, or operation of facilities, machinery, parts, materials, etc. (4) Presentation of new methods, suggestion of new angles, ideas, systematization, software, or any new facts regarding the above.