Periodic sequences with large k-error linear complexity

DOI10.1109/TIT.2002.807308MaRDI QIDQ4679928zbMATH OpenOpenAlexFDO

Authors Harald Niederreiter

Publication date 31 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2002.807308

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Cryptography and Coding
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• On the \(k\)-error linear complexity of sequences from function fields
• Periodic multisequences with large error linear complexity

Cited in

(20)

• Distribution of one-error linear complexity of binary sequences for arbitrary prime period
• On the stability of \(m\)-sequences
• Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)
• Improved results on periodic multisequences with large error linear complexity
• A construction ofp-ary balanced sequence with largek-error linear complexity
• scientific article; zbMATH DE number 4055528 (Why is no real title available?)
• scientific article; zbMATH DE number 2127875 (Why is no real title available?)
• Determining the k-error joint linear complexity spectrum for a binary multisequence with period p^n
• Element distribution of decimations and \(k\)-error linear complexity of \(l\)-sequences
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Periodic multisequences with large error linear complexity
• A relationship between linear complexity and k-error linear complexity
• Cryptography and Coding
• scientific article; zbMATH DE number 2247712 (Why is no real title available?)
• On the k-Operation Linear Complexity of Periodic Sequences
• FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)
• On the \(k\)-error linear complexity of sequences from function fields
• Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
• Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences
• On the stability of periodic binary sequences with zone restriction

This page was built for publication: Periodic sequences with large k-error linear complexity

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