An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
From MaRDI portal
(Redirected from An algorithm for the k-error linear complexity of sequences over GF(p^m) with period p^n, p a prime)
An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
