Proof of Rueppel's linear complexity conjecture (Corresp.)

DOI10.1109/TIT.1986.1057174MaRDI QIDQ3726014zbMATH OpenOpenAlexFDO

Authors Zongduo Dai

Publication date 1986

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

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

zbMATH Keywords

binary sequenceextension field of the field of rational functions over GF(2)minimum length generator

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4055528
• A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Linear Complexity of Periodically Repeated Random Sequences
• The conjecture of V. I. Nechaev on the product of linear recurrences

Cited in

(8)

• scientific article; zbMATH DE number 4055528 (Why is no real title available?)
• The conjecture of V. I. Nechaev on the product of linear recurrences
• Proof of a conjecture on word complexity
• Perfect staircase profile of linear complexity for finite sequences
• New binary sequences with perfect staircase profile of linear complexity
• Two blossoming proofs of the Lane-Riesenfeld algorithm
• The strength of multilinear proofs
• A relationship between the Berlekamp-Massey and the euclidean algorithms for linear feedback shift register synthesis

This page was built for publication: Proof of Rueppel's linear complexity conjecture (Corresp.)

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