On upper bounds for code distance and covering radius of designs in polynomial metric spaces

Journal of Combinatorial Theory, Series A

Volumn 70, Issue 2, 1995, Pages 267-288

  Fazekas, G ^a   Levenshtein, V I ^b  

^a UNIVERSITY OF DEBRECEN   (Hungary)

^b KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011656656     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/0097-3165(95)90093-4     Document Type: Article

References (43)

1. Tight spherical designs I
2. Tight spherical designs II
3. Bounds for systems of lines, and Jacobi polynomials
4. Associations schemes and t-design in regular semilattices
5. Spherical codes and designs
6. Hahn poliominals discrete harmonics and t-designs
7. Discrete quadrature and bounds on t-design
8. On upper bounds for code distance and covering radius of designs in polynomial metric spaces
9. Polynomial spaces
10. On the covering radius of binary codes
11. t-designs in projective spaces
12. Bounds for packings on a sphere and in space
13. Orthogonal polynomials duality and association schemes
14. On choosing polynomials to obtain bounds in packing problems
15. On bounds for packing in n-dimensional Euclidean space
16. Bounds for packings of metric spaces and some of their applications
17. Packing and decomposition problems for polynomial association schemes
18. Designs as maximal codes in polynomial metric spaces
19. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
20. Combinatorial Configurations in Terms of Distances
21. Averaging sets: A generalization of mean values and spherical designs
22. New bounds for the density of sphere packings in an n-dimensional Euclidean Space
23. New bounds for the density of sphere packings in an n-dimensional Euclidean Space
24. On extermal polynomials used to estimate the size of codes
25. On extermal polynomials used to estimate the size of codes
26. Recent bounds of codes sphere packing and related problems obtained by linear programming and others methods
27. Generalization of the Norse bounds to codes of higher strength
28. The covering radius of spherical designs
29. Orthogonal Polynomials
30. A characterization of P- and Q-polynomial schemes
31. Covering radius problems and character sums
32. An upper bound on the covering radius of codes as a function of the dual distance
33. Covering radius and dual distance
34. Two-point homogeneous spaces