Upper bounds for A(n,4) and A(n,6) derived from Delsarte''s linear programming bound |
| |
| Authors: | C. Roos C. de Vroedt |
| |
| Affiliation: | Department of Mathematics and Informatics, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands |
| |
| Abstract: | An appropriate version of the linear programming bound of Delsarte for binary codes is used to find explicit upper bounds for A(n, d), with d ε {4,6}. These bounds are expected to be at least as good as the linear programming bound of Delsarte itself. It is re-established that the Preparata codes are optimal. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
