Improvement of the Delsarte bound for \(\tau\)-designs when it is not the best bound possible
type: Item
instance of: scholarly article
title: Improvement of the Delsarte bound for \(\tau\)-designs when it is not the best bound possible
zbMATH Open document ID: 1013.05022
DOI: 10.1023/A:1022544725332
author: Svetla Nikova
author: Ventzislav Nikov
published in: Designs, Codes and Cryptography
publication date: 2003-04-28T00:00:00Z
review text: The problem for obtaining lower bounds on the size of designs in polynomial metric spaces is considered. The authors obtain necessary and sufficient conditions for the existence of improvements (by using linear programming) of the classical Delsarte bound. These conditions are the counterpart to corresponding conditions for codes and the test functions introduced appear to be special cases of the test functions for codes. The conditions are investigated in the general case and for infinite polynomial metric spaces. When improvements of the Delsarte bound are possible, some new bounds are constructed.
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 94C30
Mathematics Subject Classification ID: 94B75
zbMATH DE Number: 1902908
zbMATH Keywords: polynomial metric spaces
zbMATH Keywords: Delsarte bound
zbMATH Keywords: \(\tau\)-designs
reviewed by: Peter Boyvalenkov
MaRDI profile type: Publication
full work available at URL: a:1022544725332
OpenAlex ID: W1506287413
description: scientific article; zbMATH DE number 1902908