Talk:Plotkin bound

The original article only describes one aspect of the Plotkin bound. In my Coding Theory class we show that the Plotkin bound actually gives four bounds, depending on the values of ${\displaystyle d}$ and ${\displaystyle n}$. I have added the other three sections and tried to clean up the article. It's still a bit technical. If anyone has further suggestions I'm all ears. --Culix (talk) 19:40, 12 February 2008 (UTC)
Any interest in the GF(q) version for a [n,k,d] code? ${\displaystyle d\leq {\frac {nq^{k-1}(q-1)}{q^{k}-1}}}$ --76.85.202.68 (talk) 02:53, 1 March 2009 (UTC)