Talk:Plotkin bound

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Parts of the 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 $d$ and $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)[reply]

For GF(q)?

Any interest in the GF(q) version for a [n,k,d] code? $d\leq {\frac {nq^{k-1}(q-1)}{q^{k}-1}}$ --76.85.202.68 (talk) 02:53, 1 March 2009 (UTC)[reply]

I can add the proof, if anyone wants. VanceIII (talk) 08:43, 6 March 2009 (UTC)[reply]