Connection between Classification and minimum polynomial of Multiplexed Sequences
Linear recurrent sequences are used in many areas like cryptology, electronics, coding theory, where they play an important rote.
However, they suffer a great weakness before BerlekamP-Massey algorithms attacks. This is the motivation of the creation of the multiplexed sequences constituted by two maximal period sequences
with respective periods 2k-1 and 2m-1, k and m being their being their respective orders.
Here is devised a method to determine the complexifies?maximal period sequences constituting a multiplexed sequence in certain conditions. It is also given a connection between the classification of the multiplexed sequences and their minimum
polynomial of a multiplexed sequence.
Auteur(s) : O.DIANKHA and C. B. DEME
Pages : 105-120
Année de publication : 2012
Revue : Far East Journal of Mathematical Sciences (FJMS)
N° de volume : 24
Type : Article
Mise en ligne par : DIANKHA Oumar