An extremum problem for polynomials and bounds for codes with given distance and diameter

DOI10.1016/S0895-7177(03)90063-XzbMath1046.94017OpenAlexW2036069803MaRDI QIDQ596963

G. Fazekas

Publication date: 6 August 2004

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(03)90063-x

zbMATH Keywords

diameterannihilating polynomialcode distanceLloyd-type theoremspolynomial metric spaces

Mathematics Subject Classification ID

Contents, measures, outer measures, capacities (28A12) Bounds on codes (94B65) Application of orthogonal and other special functions (94A11)

Cites Work

• Designs as maximum codes in polynomial metric spaces
• Association schemes and t-designs in regular semilattices
• Spherical codes and designs
• Two-point homogeneous spaces
• Association schemes and coding theory
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item