On linear programming bounds for codes in polynomial metric spaces

zbMath0917.94020MaRDI QIDQ1276778

Danyo Danev, P. G. Boyvalenkov

Publication date: 16 August 1999

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

algorithmupper boundscardinalityminimum distancelinear programming boundsbinary Hamming spacezonal spherical functionscodes of a fixed cardinalitypolynomial metric space

Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65) Other types of codes (94B60)

Related Items (4)

Energy bounds for codes and designs in Hamming spaces ⋮ Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ Linear programming bounds for codes in infinite projective spaces ⋮ Energy bounds for codes in polynomial metric spaces

This page was built for publication: On linear programming bounds for codes in polynomial metric spaces