2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
From MaRDI portal
Publication:5205028
Recommendations
- Linear complexity of Whiteman's generalized cyclotomic sequences of order \(2k\)
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2ᵏ
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- 2-adic complexity of two classes of generalized cyclotomic binary sequences
- The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
- Symmetric 4-adic complexity of quaternary generalized cyclotomic sequences of order four with period \(2p^n\)
- The linear complexity of new generalized cyclotomic binary sequences of order four
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
Cites work
- scientific article; zbMATH DE number 1030997 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- $2$-Adic Complexity of Binary $m$-Sequences
- 2-Adic shift registers
- 2-adic complexity of binary sequences with interleaved structure
- 2-adic complexity of two classes of generalized cyclotomic binary sequences
- A New Construction of Zero-Difference Balanced Functions and Its Applications
- A New Method to Compute the 2-Adic Complexity of Binary Sequences
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
- A family of difference sets
- Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”
- Cyclic Codes From the Two-Prime Sequences
- Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Feedback shift registers, 2-adic span, and combiners with memory
- Gauss periods and codebooks from generalized cyclotomic sets of order four
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2ᵏ
- New generalized cyclotomy and its applications
- Optimal Frequency Hopping Sequences of Odd Length
- Optimal frequency-hopping sequence sets based on cyclotomy
- Several classes of binary sequences with three-level autocorrelation
- Shift-register synthesis and BCH decoding
- The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
- The linear complexity of balanced quaternary sequences with optimal autocorrelation value
Cited in
(6)- A lower bound on the 2-adic complexity of the modified Jacobi sequence
- The linear complexity of new generalized cyclotomic binary sequences of order four
- Linear complexity of Whiteman's generalized cyclotomic sequences of order \(2k\)
- Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period \(p q\)
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2ᵏ
- On the 4-adic complexity of the two-prime quaternary generator
This page was built for publication: 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205028)
