Characterization of 2ⁿ-periodic binary sequences with fixed 2-error or 3-error linear complexity

DOI10.1007/S10623-009-9295-XMaRDI QIDQ1035809zbMATH OpenOpenAlexFDO

Authors Ramakanth Kavuluru

Publication date 4 November 2009

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-009-9295-x

Mathematics Subject Classification ID

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

Recommendations

• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
• scientific article; zbMATH DE number 6262500
• On the 2-error linear complexity of 2ⁿ-periodic balanced binary sequences

Cites work

• scientific article; zbMATH DE number 1196713 (Why is no real title available?)
• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• A relationship between linear complexity and k-error linear complexity
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Analysis and design of stream ciphers
• Counting functions and expected values for the \(k\)-error linear complexity
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Remarks on the k-error linear complexity of p^n-periodic sequences
• Shift-register synthesis and BCH decoding
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• The stability theory of stream ciphers

Cited in

(14)

• The distribution of 2ⁿ-periodic binary sequences with fixed k-error linear complexity
• Characterization of the third descent points for the k-error linear complexity of 2ⁿ-periodic binary sequences
• A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
• scientific article; zbMATH DE number 6262500 (Why is no real title available?)
• Analysis of the linear complexity and its stability for periodic binary sequences
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
• 2ⁿ-periodic binary sequences with 8-error linear complexity as the second descent point
• Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
• On the stability of periodic binary sequences with zone restriction
• Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences

This page was built for publication: Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity

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