On the linear complexity of multisequences, bijections between Zahlen and Number tuples, and partitions

MaRDI QIDQ2811687zbMATH OpenFDO

Authors Michael Vielhaber

Publication date 10 June 2016

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) Pseudo-random numbers; Monte Carlo methods (11K45)

Recommendations

• Enumeration results on the joint linear complexity of multisequences
• scientific article; zbMATH DE number 27750
• A combinatorial proof of \(S\)-adicity for sequences with linear complexity
• On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
• On the linear complexity for multidimensional sequences
• Sequences, q-Multinomial Identities, Integer Partitions with Kinds, and Generalized Galois Numbers
• Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
• scientific article; zbMATH DE number 1740036
• Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields
• Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences

This page was built for publication: On the linear complexity of multisequences, bijections between \(\mathbb Z\)ahlen and \(\mathbb N\)umber tuples, and partitions

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