DOI: 10.1039/b000000x Abstract: We found the linear complexity of quaternary sequences of period over the ring. The sequences are based on Whiteman's generalized cyclotomic classes of order four. Also we derived the maximum nontrivial autocorrelation magnitude of the constructed sequences
Binary sequences with good autocorrelation are needed in many applications. A construction of binary...
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al....
An efficient algorithm for determining the linear complexity and the minimal polynomial of a sequenc...
Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are inves...
Ding constructed a new cyclotomic class V0 ,V1. Based on it, a construction of generalized cyclotomi...
Sequences with high linear complexity property are of importance in applications. In this paper, bas...
Binary sequences with optimal autocorrelation are needed in many applications. Two constructions of ...
Generalized cyclotomic sequences of period pq have several desirable randomness properties if the tw...
Sequences with high linear complexity have wide applications in cryptography. In this paper, a new c...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
In this paper, we mainly get three results. First, let p, q be distinct primes with \gcd ((p-1)p,(q-...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a ...
Binary sequences with good autocorrelation are needed in many applications. A construction of binary...
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al....
An efficient algorithm for determining the linear complexity and the minimal polynomial of a sequenc...
Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are inves...
Ding constructed a new cyclotomic class V0 ,V1. Based on it, a construction of generalized cyclotomi...
Sequences with high linear complexity property are of importance in applications. In this paper, bas...
Binary sequences with optimal autocorrelation are needed in many applications. Two constructions of ...
Generalized cyclotomic sequences of period pq have several desirable randomness properties if the tw...
Sequences with high linear complexity have wide applications in cryptography. In this paper, a new c...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
In this paper, we mainly get three results. First, let p, q be distinct primes with \gcd ((p-1)p,(q-...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a ...
Binary sequences with good autocorrelation are needed in many applications. A construction of binary...
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al....
An efficient algorithm for determining the linear complexity and the minimal polynomial of a sequenc...
DOI
Add to ORKG