Linear complexity of polylinear sequences

DOI10.1515/DMA.2001.11.1.1MaRDI QIDQ4809510zbMATH OpenOpenAlexFDO

Authors V. L. Kurakin

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2001.11.1.1

zbMATH Keywords

linear complexitylinear recurring sequence

Mathematics Subject Classification ID

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

Recommendations

• Linear recurring sequences over modules
• scientific article; zbMATH DE number 1504612
• Linear recurring sequences over noncommutative rings.
• Linear recurring sequences over rings and modules
• Polynomial transforms of linear recurring sequences over finite commutative rings

Cited in

(8)

• Weighted moving averaging revisited: an algebraic approach
• Line complexity asymptotics of polynomial cellular automata
• Parallel decomposition of nonautonomous 2-linear shift registers
• Linear recurring sequences over modules
• An extended Prony's interpolation scheme on an equispaced grid
• Linear recurring sequences over noncommutative rings.
• scientific article; zbMATH DE number 5150220 (Why is no real title available?)
• scientific article; zbMATH DE number 1504612 (Why is no real title available?)

This page was built for publication: Linear complexity of polylinear sequences

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