| Title | New Upper Bounds for Nonbinary Codes Based on the Terwilliger Algebra and Semidefinite Programming |
|---|---|
| Published in | Journal of Combinatorial Theory, Series A, Vol. 113, No. 8, p.1719-1731. |
| Author | Gijswijt, D.C.; Schrijver, A. |
| Date | 2006 |
| Type | article |
| Summary | Abstract: We give a new upper bound on the maximum size $A_q(n,d)$ of a code of word length $n$ and minimum Hamming distance at least $d$ over the alphabet of $q\geq 3$ letters. By block-diagonalizing the Terwilliger algebra of the nonbinary Hamming scheme, the bound can be calculated in time polynomial in $n$ using semidefinite programming. For $q=3,4,5$ this gives several improved upper bounds for concrete values of $n$ and $d$. This work is related to \cite{Lex}, where a similar approach is used to derive upper bounds for binary codes. |
| Publication | http://dare.uva.nl/record/223222 |
| OpenURL | Search this publication in (your) library |
| Persistent Identifier | urn:nbn:nl:ui:29-223222 |
| Metadata | XML |
| Repository | University of Amsterdam |
Go to page top
Go back to contents
Go back to site navigation