scientific article; zbMATH DE number 1868122

zbMath1007.11082MaRDI QIDQ4793665

Satoshi Uehara, Kyoki Imamura, Takayasu Kaida

Publication date: 12 February 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite fields\(k\)-error linear complexityStamp-Martin algorithm for binary sequences

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Sequences (mod (m)) (11B50)

Related Items (5)

Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences ⋮ An algorithm fork-error joint linear complexity of binary multisequences ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields ⋮ Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform ⋮ Counting functions and expected values for the \(k\)-error linear complexity

This page was built for publication: