An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
From MaRDI portal
Publication:1854286
DOI10.1006/inco.1998.2768zbMath1011.94010OpenAlexW1982035040MaRDI QIDQ1854286
Kyoki Imamura, Takayasu Kaida, Satoshi Uehara
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1998.2768
Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (9)
Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) ⋮ Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences ⋮ On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) ⋮ An algorithm fork-error joint linear complexity of binary multisequences ⋮ Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences ⋮ An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences ⋮ On the Stability of m-Sequences ⋮ A construction ofp-ary balanced sequence with largek-error linear complexity ⋮ On the stability of periodic binary sequences with zone restriction
Cites Work
- The stability theory of stream ciphers
- 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/
- A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
- Linear complexity for one-symbol substitution of a periodic sequence over GF(q)
This page was built for publication: An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
