Cryptography and Coding

DOI10.1007/B93924MaRDI QIDQ5428161zbMATH OpenOpenAlexFDO

Authors Harald Niederreiter, Igor E. Shparlinski

Publication date 28 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b93924

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Periodic sequences with large k-error linear complexity
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
• A relationship between linear complexity and k-error linear complexity
• Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)

Cited in

(12)

• Periodic multisequences with large error linear complexity
• Periods of termwise exclusive ors of maximal length FCSR sequences
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings
• scientific article; zbMATH DE number 2127875 (Why is no real title available?)
• A construction ofp-ary balanced sequence with largek-error linear complexity
• Distribution of one-error linear complexity of binary sequences for arbitrary prime period
• Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period
• Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences
• Periodic sequences with large k-error linear complexity
• On the k-Operation Linear Complexity of Periodic Sequences
• Improved results on periodic multisequences with large error linear complexity

This page was built for publication: Cryptography and Coding

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