Extremal polynomials used in bounds of code volume
From MaRDI portal
Publication:1156770
zbMath0468.94010MaRDI QIDQ1156770
Publication date: 1980
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (10)
Extremal polynomials for obtaining bounds for spherical codes and designs ⋮ New upper bounds on sphere packings. II ⋮ Derivatives of bent functions in connection with the bent sum decomposition problem ⋮ Delsarte method in the problem on kissing numbers in high-dimensional spaces ⋮ Universal lower bounds for potential energy of spherical codes ⋮ The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Unnamed Item ⋮ Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
This page was built for publication: Extremal polynomials used in bounds of code volume
