This paper presents an explicit construction for an ((n = 2qt, k = 2q{t−1), d = n − (q + 1)), (α = q(2q)t−1,β = α/q)) regenerating code over a field Fq operating at the Minimum Storage Regeneration (MSR) point. The MSR code can be constructed to have rate k/n as close to 1 as desired, sub-packetization level α ≤ rn/r for r = (n − k), field size Q no larger than n and where all code symbols can be repaired with the same minimum data download. This is the first-known construction of such an MSR code for d < (n − 1).