Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar

Appendix A: A Maple Program for Step 3 in Algorithm 3.1

Appendix A: A Maple Program for Step 3 in Algorithm 3.1

Comments: In this Maple program, we set the parameters for computing the minimal polynomial of ? 3 in GF(2 4) defined by the primitive polynomial f( x) = x 4 + x + 1 where ? is a root of f( x). So, for computing the minimal polynomials for different elements in different fields, one should reset the parameters.

writeto('output-file'):n:=4;p:=2;q:=p n?1;alias(alpha=RootOf(z 4+z+1)):C:=[3, 6, 12, 9]; #coset with coset leader 3 modulo 15m:=1: # a variable that holding the minimal polynomialfor d in C do    m:=Expand(m*(x+alpha d)) mod pod:print(m);quit;

UNLIMITED FREE
ACCESS
TO THE WORLD'S BEST IDEAS

SUBMIT
Already a GlobalSpec user? Log in.

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

Customize Your GlobalSpec Experience

Category: Radiation Detectors
Finish!
Privacy Policy

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.