%constructing binary m-sequence, memory given;
function d=bmsq(n); %input variable is memory;
f=gfprimdf(n,2); N=2^n-1; %primitive polynomial and length of sequence;
d=[1 zeros(1,N-1)]; %initialization of m-sequence;
for k=n+1:N
    d(k)=sum(f(1:n).*d(k-n:k-1)); d(k)=rem(d(k),2);
end; %m-sequence is ready;