An extremum problem for polynomials and bounds for codes with given distance and diameter
type: Item
instance of: scholarly article
title: An extremum problem for polynomials and bounds for codes with given distance and diameter
zbMATH Open document ID: 1046.94017
DOI: 10.1016/S0895-7177(03)90063-X
author: Gábor Fazekas
published in: Mathematical and Computer Modelling
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 28A12
Mathematics Subject Classification ID: 94A11
zbMATH DE Number: 2082400
zbMATH Keywords: Lloyd-type theorems
zbMATH Keywords: polynomial metric spaces
zbMATH Keywords: code distance
zbMATH Keywords: diameter
zbMATH Keywords: annihilating polynomial
MaRDI profile type: Publication
cites work: Q3876610
cites work: Q3665801
cites work: Designs as maximum codes in polynomial metric spaces
cites work: Q3992965
cites work: Q5707657
cites work: Q4083446
cites work: Association schemes and t-designs in regular semilattices
cites work: Spherical codes and designs
cites work: Hahn Polynomials, Discrete Harmonics, andt-Designs
cites work: Association schemes and coding theory
cites work: Two-point homogeneous spaces
full work available at URL: s0895-7177(03)90063-x
OpenAlex ID: W2036069803
Recommended article: An extremum problem for polynomials related to codes and designs
Recommended article: Q4886131
Recommended article: Q5414557
Recommended article: Q3838679
Recommended article: Q4279504
Recommended article: Q4470457
Recommended article: Extremal polynomials for obtaining bounds for spherical codes and designs
Recommended article: On linear programming bounds for codes in polynomial metric spaces
Recommended article: On upper bounds for code distance and covering radius of designs in polynomial metric spaces
Recommended article: Bounds on Distance Distributions in Codes of Given Size
description: scientific article; zbMATH DE number 2082400