✦ LIBER ✦

Extremal polynomials for obtaining bounds for spherical codes and designs

✍ Scribed by P. Boyvalenkov

Book ID: 110559142
Publisher: Springer
Year: 1995
Tongue: English
Weight: 797 KB
Volume: 14
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02570701

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Linear Programming Bounds for Spheric

On Linear Programming Bounds for Spherical Codes and Designs

✍ Alex Samorodnitsky 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 159 KB

Bounds and Inequalities for Lm Extremal

Bounds and Inequalities for Lm Extremal Polynomials

✍ Ying Guang Shi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Information-theoretic bounds for authent

Information-theoretic bounds for authentication codes and block designs

✍ Dingyi Pei 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 480 KB

Authentication codes with secrecy and with splitting are investigated. An information-theoretic lower bound for the probability of successful deception for a spoofing attack of order r is obtained. The condition necessary on authentication codes to achieve the lower bound is determined as a single s

An extremum problem for polynomials rela

An extremum problem for polynomials related to codes and designs

✍ D. V. Gorbachev; V. I. Ivanov 📂 Article 📅 2000 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 284 KB

A bound for certains-extremal lattices a

A bound for certains-extremal lattices and codes

✍ Philippe Gaborit 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 155 KB

An extremum problem for polynomials and

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

✍ G. Fazekas 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 442 KB

this paper, proving first a Lloyd-type theorem we solve an extremum problem for systems of orthogonal polynomials and show how this result can be applied to the estimation of the cardinality of codes with given minimal distance and diameter in polynomial metric spaces. A similar approach has been es