Can someone please help with the following proof:
C is a binary [n, k, d]-code.
Suppose d ≥ 2t + 1. Show that every word of weight ≤ t is a coset leader in every Slepian array for C.
So i know n = length, k = dimension and d = distance and the slepian array is a way of displaying the cosets of C
I have tried taking the approach that we know the number of cosets is q^(n-k) and therefore i tried to use that knowledge to form a proof, as choosing cosets is based on minimum weight however I didnt get very far
Thanks in advance