A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets
From MaRDI portal
Publication:3588582
DOI10.1007/978-3-642-15874-2_10zbMath1256.11073OpenAlexW1486146792MaRDI QIDQ3588582
Wilfried Meidl, Ayça Çeşmelioǧlu
Publication date: 8 September 2010
Published in: Sequences and Their Applications – SETA 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15874-2_10
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items
The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) ⋮ Design sequences with high linear complexity over finite fields using generalized cyclotomy ⋮ Remarks on the generalized cyclotomic sequences of length \(2p^m\) ⋮ The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)