Title: Improvement of the Delsarte bound for tau-designs when it is not the best bound possible
Authors: Nikova, Svetla ×
Nikov, V #
Issue Date: 2003
Publisher: Springer Netherlands
Series Title: Designs, Codes and Cryptography vol:28 issue:2 pages:201-222
Abstract: In this paper the problem for improvement of the Delsarte bound for tau-designs is investigated. Two main results are presented. Firstly, necessary and sufficient conditions for improving the bound are proved. We define test functions with the property that they are negative if and only if the Delsarte bound D(M, tau) can be improved by linear programming. Then we investigate the infinite polynomial metric spaces and give exact intervals, when the Delsarte bound is not the best linear programming bound possible. Secondly, we derive a new bound for the infinite PMS. Analytical forms of the extremal polynomials of degree tau + 2 for non-antipodal PMS and of degree tau + 3 for antipodal PMS are given. The new bound is investigated in different asymptotical processes for infinite PMS. When tau and n grow simultaneously to infinity our bound is better than Delsarte bound.
ISSN: 0925-1022
Publication status: published
KU Leuven publication type: IT
Appears in Collections:ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
article-161.pdf Published 156KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science