On linear programming bounds for codes in polynomial metric spaces (Q1276778): Difference between revisions

This paper investigates the possibilities for improving the best known universal linear programming bounds on the cardinality and the minimum distance of codes in a polynomial metric space (PMS) \(M\). Functions \(P_j(M,s)\) have been introduced obeying some condition. A formula for \(P_j(M,s)\) depending on the zonal spherical functions (corresponding to \(M\)) and \(s\) is given. Applications in different polynomial metric spaces are considered with special emphasis on the Euclidean spheres and the binary Hamming space. An algorithm for computer calculations of \(P_j(M,s)\) is also described. A method for obtaining new upper bounds on the minimum distance of codes of a fixed cardinality is presented as well.