Cube Theory and Stable $$k$$-Error Linear Complexity for Periodic Sequences

DOI10.1007/978-3-319-12087-4_5zbMath1347.94066OpenAlexW216176640MaRDI QIDQ3454143

Guanglu Zhou, Wanquan Liu, Jian-Qin Zhou

Publication date: 2 December 2015

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12087-4_5

zbMATH Keywords

linear complexityperiodic sequence\(k\)-error linear complexitycube theorystable \(k\)-error linear complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (4)

Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences ⋮ Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences ⋮ On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences

This page was built for publication: Cube Theory and Stable $$k$$-Error Linear Complexity for Periodic Sequences