New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
From MaRDI portal
Publication:456074
DOI10.1016/J.IPL.2012.05.011zbMath1250.94037OpenAlexW1975333019MaRDI QIDQ456074
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.05.011
Related Items (9)
The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) ⋮ A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity ⋮ Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\) ⋮ A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity ⋮ New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ Autocorrelation values of quaternary cyclotomic sequence of length 2pm ⋮ On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation ⋮ On the properties of generalized cyclotomic binary sequences of period \(2p^m\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Linear Complexity of Some Generalized Cyclotomic Sequences
- Linear Complexity and Autocorrelation of Prime Cube Sequences
- Shift-register synthesis and BCH decoding
This page was built for publication: New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
