Algebra, V, p. 169
Let t, n, k be three integers ≥1 such that t≤n and n divides 2k−1. Let S be the smallest set of integers such that (1,t)⊂S⊂(1,n) and the condition « i ∈S, 2i≡j(modn) and 1≤j≤n » implies j∈S. Put m=Card S. Let ξ be an element of order n in F2k∗ and put P(X)=∏j∈S(X−ξj). a) Prove that P(X)∈F2[X]. b) Show that if R(X)∈F2[X] is of degree <n and is a non-zero multiple of P(X), then there are strictly more than t non-zero coefficients. c) Deduce the construction of a mapping Q:F2n→F2m such that if u,v∈F2n are distinct and have at most t distinct coordinates then Q(u)≡Q(v). d) Calculate S, m and P when t=6, n=15, k=4.