Counting functions for 2ⁿ-periodic binary sequences with 4-error linear complexity

MaRDI QIDQ2951278zbMATH OpenFDO

Authors Songsong Bi, Xiaoping Dai

Publication date 6 January 2017

zbMATH Keywords

\(k\)-error linear complexitycritical error linear complexitycube theorysieve method

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
• scientific article; zbMATH DE number 6262500
• The distribution of 2ⁿ-periodic binary sequences with fixed k-error linear complexity
• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3

Cited in

(5)

• 2ⁿ-periodic binary sequences with 8-error linear complexity as the second descent point
• Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
• A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences
• Метод тригонометрических сумм для исследования частот $r$-грамм в старших координатных последовательностях линейных рекуррент над кольцом $\mathbb{Z}_{2^n}$
• Some enumeration results on binary 2ⁿ-periodic sequences

This page was built for publication: Counting functions for \(2^n\)-periodic binary sequences with 4-error linear complexity

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