o_O I thought the Plotkin bound was a bound for . Are you sure you have this right? Here you're bounding (above) the minimum distance between codewords... what's the point? xD
Edit: ok, I guess I can see some interest in doing it However, the bound you present here appears to be wrong: take the code , which is a binary code. Your bound states that
which is false.