Connection between classification and minimum polynomial of multiplexed sequences

MaRDI QIDQ2837921zbMATH OpenFDO

Authors Oumar Diankha, Chérif Bachir Deme

Publication date 8 July 2013

Published in Far East Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL http://www.pphmj.com/abstract/6649.htm

zbMATH Keywords

finite fieldlinear recurrent sequenceminimum polynomialmultiplexed sequencerandom generatorsequence complexitystream cipher

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 3865150
• scientific article; zbMATH DE number 6529183
• Minimal Polynomial Algorithms for Finite Sequences
• On connection sequence for equivalent polynomial sets
• scientific article; zbMATH DE number 4042032
• On the connection problem between two classical orthogonal polynomial sequences
• On enumeration of polynomial equivalence classes and their application to MPKC
• Minimal polynomials of the modified de Bruijn sequences
• Minimal Polynomials of the Modified de Bruijn Sequences
• A link between two classes of permutation polynomials

Cited in

(2)

• Linear recurrent sequences over a finite field and applications in cryptography
• scientific article; zbMATH DE number 3865150 (Why is no real title available?)

This page was built for publication: Connection between classification and minimum polynomial of multiplexed sequences

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