Generation of large primitive polynomial over a Galois field has been a topic of intense research over the years. The problem of finding a primitive polynomial over a Galois field of a large degree is computationaly expensive and there is no deterministic algorithm for the same. In this paper we present an new recursive algorithm based on cellular automata for generation of very large primitive polynomial over finite fields. The motivation for cellular automata based construction comes into play as it has an excellent regular structure and efficient hardware representation. At the end we give an application of this new construction in a RS-encoded MPSK Modulation in Rayleigh fading channel. But the general construction given here can be extended to any area like cryptography, coding theory etc. having application of sufficiently large Galois field. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Bhattacharya, D., Mukhopadhyay, D., & RoyChowdhury, D. (2006). A cellular automata based approach for generation of large primitive polynomial and its application to RS-coded MPSK modulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4173 LNCS, pp. 204–214). Springer Verlag. https://doi.org/10.1007/11861201_25
Mendeley helps you to discover research relevant for your work.