On the error linear complexity spectrum of \(p^n\)-periodic binary sequences
From MaRDI portal
Publication:2441445
DOI10.1007/s00200-013-0210-3zbMath1283.94045OpenAlexW2102029311MaRDI QIDQ2441445
Publication date: 24 March 2014
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-013-0210-3
algorithmlinear complexitystream cipher\(k\)-error linear complexityerror linear complexity spectrum
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Cites Work
- How many bits have to be changed to decrease the linear complexity?
- A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/