Skip to Content

4 Results Found

  • Article
  • Open Access
3 Citations
1,483 Views
8 Pages

31 October 2024

Frequency-hopping sequences (FHSs) with low Hamming correlation are essential for synchronization and multiple-access communication systems. In this paper, we propose a novel construction of FHSs using generalized cyclotomy. Our results reveal that t...

(This article belongs to the Special Issue Advances in Information and Coding Theory, the Third Edition)
  • Article
  • Open Access
2,193 Views
9 Pages

12 October 2019

Recently Edemskiy proposed a method for computing the linear complexity of generalized cyclotomic binary sequences of period p n + 1 , where p = d R + 1 is an odd prime, d , R are two non-negative integers, and n > 0 ...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
2 Citations
2,435 Views
13 Pages

16 September 2021

Linear complexity is an important property to measure the unpredictability of pseudo-random sequences. Trace representation is helpful for analyzing cryptography properties of pseudo-random sequences. In this paper, a class of new Ding generalized cy...

  • Article
  • Open Access
1,669 Views
15 Pages

11 August 2024

Linear complexity is an important pseudo-random measure of the key stream sequence in a stream cipher system. The 1-error linear complexity is used to measure the stability of the linear complexity, which means the minimal linear complexity of the ne...

(This article belongs to the Section E1: Mathematics and Computer Science)