Asymptotically optimal aperiodic quasi-complementary sequence sets based on extended Boolean functions

IF 1.4 2区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Designs, Codes and Cryptography Pub Date : 2024-09-28 DOI:10.1007/s10623-024-01501-y

Bingsheng Shen, Tao Yu, Zhengchun Zhou, Yang Yang

引用次数: 0

Abstract

Quasi-complementary sequence sets (QCSSs) are important in modern communication systems as they are capable of supporting more users, which is desired in applications like MC-CDMA nowadays. Although several constructions of aperiodic QCSSs have been proposed in the literature, the known optimal aperiodic QCSSs have limited length or have large alphabet. In this paper, based on extended Boolean functions, we present two constructions of aperiodic QCSSs with parameters \((q(p_0-1),q,q-t,q)\) and \((q^m(p_0-1),q^m,q^m-t,q^m)\), where \(q\ge 3\) is an odd integer, \(p_0\) is the minimum prime factor of q. The proposed constructions can generate asymptotically optimal or near-optimal aperiodic QCSSs with new parameters.

Abstract Image

查看原文本刊更多论文

基于扩展布尔函数的渐近最优非周期性准互补序列集

准互补序列集（QCSS）在现代通信系统中非常重要，因为它们能够支持更多用户，这正是如今 MC-CDMA 等应用所需要的。虽然文献中提出了几种非周期性 QCSS 的构造，但已知的最优非周期性 QCSS 长度有限或字母表较大。本文基于扩展布尔函数，提出了参数为（(q(p_0-1),q,q-t,q)）和（(q^m(p_0-1),q^m,q^m-t,q^m)）的两种非周期性 QCSS 结构，其中（q^m(p_0-1),q^m,q^m-t,q^m)）为奇整数，（p_0）为 q 的最小质因子。所提出的构造可以生成具有新参数的渐近最优或接近最优的非周期性 QCSS。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Designs, Codes and Cryptography 工程技术-计算机：理论方法

CiteScore

2.80

自引率

12.50%

发文量

157

审稿时长

16.5 months

期刊介绍： Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.