scientific article; zbMATH DE number 1426192

MaRDI QIDQ4950448zbMATH OpenFDO

Authors Harriet Fell

Publication date 30 March 2000

Mathematics Subject Classification ID

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

Recommendations

• How many bits have to be changed to decrease the linear complexity?
• A relationship between linear complexity and k-error linear complexity
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform

Cited in

(7)

• Periodic multisequences with large error linear complexity
• On complexity of round transformations
• Optimal linear contractive sequence transformations
• Linear recurring sequences over rings and modules
• A construction ofp-ary balanced sequence with largek-error linear complexity
• scientific article; zbMATH DE number 672007 (Why is no real title available?)
• scientific article; zbMATH DE number 1972834 (Why is no real title available?)

This page was built for publication:

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