On the k-Operation Linear Complexity of Periodic Sequences
From MaRDI portal
Publication:5458219
DOI10.1007/978-3-540-77026-8_24zbMATH Open1153.94337OpenAlexW1525775766MaRDI QIDQ5458219FDOQ5458219
Authors: Ramakanth Kavuluru, Andrew Klapper
Publication date: 11 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77026-8_24
Recommendations
- scientific article; zbMATH DE number 2127875
- Linear complexity of periodic sequences: a general theory
- Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences
- On the calculation of the linear complexity of periodic sequences
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Cryptography and Coding
- Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
- On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
- New Results on Periodic Sequences With Large $k$-Error Linear Complexity
- Periodic sequences with large k-error linear complexity
linear complexity\(k\)-error linear complexity\(k\) symbol deletion\(k\) symbol insertionPeriodic sequence
Cites Work
Cited In (2)
This page was built for publication: On the k-Operation Linear Complexity of Periodic Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458219)