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

DOI10.1109/TIT.1986.1057174zbMath0594.94025OpenAlexW2152967286MaRDI QIDQ3726014

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

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

Related Items (3)

Perfect staircase profile of linear complexity for finite sequences ⋮ New binary sequences with perfect staircase profile of linear complexity ⋮ 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.)