On linear programming bounds for codes in polynomial metric spaces (Q1276778): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:57, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On linear programming bounds for codes in polynomial metric spaces |
scientific article |
Statements
On linear programming bounds for codes in polynomial metric spaces (English)
0 references
16 August 1999
0 references
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.
0 references
linear programming bounds
0 references
cardinality
0 references
minimum distance
0 references
polynomial metric space
0 references
zonal spherical functions
0 references
binary Hamming space
0 references
algorithm
0 references
upper bounds
0 references
codes of a fixed cardinality
0 references