On Maximal Codes in Polynominal Metric Spaces
1997
We study the possibilities for attaining the best known universal linear programming bounds on the cardinality of codes in polynomial metric spaces (finite or infinite). We show that in many cases these bounds cannot be attained. Applications in different antipodal polynomial metric spaces are considered with special emphasis on the Euclidean sphere and the binary Hamming space.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
27
References
15
Citations
NaN
KQI