๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Products of linear recurring sequences with maximum complexity

โœ Scribed by Rueppel, R.; Staffelbach, O.

Book ID
114636630
Publisher
IEEE
Year
1987
Tongue
English
Weight
1022 KB
Volume
33
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Products of linear recurring sequences
Products of linear recurring sequences
โœ Neal Zierler; W.H Mills ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 444 KB
Decimations of linear recurring sequence
Decimations of linear recurring sequences
โœ M. Buck; N. Zierler ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 357 KB

We exploit a connection between decimations and products to deduce the generating polynomials of decimations of linear recurring sequences over an arbitrary field from known results concerning products. We also discuss ways of computing such polynomials.