m-tight error linear complexity of binary sequences with period 2p^n

zbMATH Open1265.94063MaRDI QIDQ2916331FDOQ2916331

Jianqin Zhou, Jun Hu, Hongcheng Cui

Publication date: 5 October 2012

Published in: Journal of Suzhou University of Science and Technology. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

cryptographylinear complexitystream cipherperiodic sequence

Mathematics Subject Classification ID

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

Cited In (3)

• On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)
• Title not available (Why is that?)
• On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two

   Recommendations

• On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences 👍 👎
• An algorithm for the \(k\)-error linear complexity of binary sequences with period \(2p^m\) 👍 👎
• An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences 👍 👎
• On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) 👍 👎
• On the error linear complexity spectrum of \(p^n\)-periodic binary sequences 👍 👎

This page was built for publication: \(m\)-tight error linear complexity of binary sequences with period \(2p^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2916331)