An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (Q742512): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The stability theory of stream ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of the Error Linear Complexity Spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between linear complexity and k-error linear complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many bits have to be changed to decrease the linear complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting functions and expected values for the \(k\)-error linear complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expected value of the linear complexity and the k-error linear complexity of periodic sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and design of stream ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q) / rank
 
Normal rank

Latest revision as of 01:11, 9 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences
scientific article

    Statements

    An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (English)
    0 references
    0 references
    18 September 2014
    0 references
    linear complexity
    0 references
    \(k\)-error linear complexity
    0 references
    algorithm
    0 references
    error sequence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references