On the Nonexistence of Almost Difference Sets Constructed from the Set of Octic Residues

被引:0
|
作者
Qi, Minglong [1 ]
Xiong, Shengwu [1 ]
Yuan, Jingling [1 ]
Rao, Wenbi [1 ]
Zhong, Luo [1 ]
机构
[1] Wuhan Univ Technol, Sch Comp Sci & Technol, Mafangshan West Campus, Wuhan 430070, Peoples R China
关键词
binary sequence; three-level autocorrelation; difference set; almost difference set; set of octic residues; BINARY SEQUENCES; LINEAR COMPLEXITY;
D O I
10.1587/transfun.E99.A.666
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Pseudorandom binary sequences balanced and with optimal autocorrelation have many applications in the stream cipher, communication, coding theory, etc. Constructing a binary sequences with three-level autocorrelation is equivalent to finding the corresponding characteristic set of the sequences that should be an almost difference set. In the work of T.W. Cusick, C. Ding, and A. Renvall in 1998, the authors gave the necessary and sufficient conditions by which a set of octic residues modulo an odd prime forms an almost difference set. In this paper we show that no integers verify those conditions by the theory of generalized Pell equations. In addition, by relaxing the definition of almost difference set given by the same authors, we could construct two classes of modified almost difference sets and two ones of difference sets from the set of octic residues.
引用
收藏
页码:666 / 673
页数:8
相关论文
共 47 条
  • [21] A new family of almost difference sets and some necessary conditions
    Zhang, Y
    Lei, JG
    Zhang, SP
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) : 2052 - 2061
  • [22] Hybridization of almost difference sets and DFT technique for concentric circular antenna array thinning
    Nath, Ganimidi Veerendra
    Subhashini, K. R.
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2024, 179
  • [23] Difference Sets Disjoint from a Subgroup
    Courtney Hoagland
    Stephen P. Humphries
    Nathan Nicholson
    Seth Poulsen
    Graphs and Combinatorics, 2019, 35 : 579 - 597
  • [24] Difference Sets Disjoint from a Subgroup
    Hoagland, Courtney
    Humphries, Stephen P.
    Nicholson, Nathan
    Poulsen, Seth
    GRAPHS AND COMBINATORICS, 2019, 35 (03) : 579 - 597
  • [25] Triple arrays from difference sets
    Nilson, Tomas
    Cameron, Peter J.
    JOURNAL OF COMBINATORIAL DESIGNS, 2017, 25 (11) : 494 - 506
  • [26] Grassmannian codes from paired difference sets
    Matthew Fickus
    Joseph W. Iverson
    John Jasper
    Emily J. King
    Designs, Codes and Cryptography, 2021, 89 : 2553 - 2576
  • [27] Grassmannian codes from paired difference sets
    Fickus, Matthew
    Iverson, Joseph W.
    Jasper, John
    King, Emily J.
    DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (11) : 2553 - 2576
  • [28] Binary sequence sets with favorable correlations from difference sets and MDS codes
    Paterson, KG
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) : 172 - 180
  • [29] Asynchronous channel hopping systems from difference sets
    Xiaotian Chen
    Yue Zhou
    Designs, Codes and Cryptography, 2017, 83 : 179 - 196
  • [30] Asynchronous channel hopping systems from difference sets
    Chen, Xiaotian
    Zhou, Yue
    DESIGNS CODES AND CRYPTOGRAPHY, 2017, 83 (01) : 179 - 196