𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of Delsarte’s linear programming bound as a ratio bound

✍ Scribed by Carlos J. Luz

Book ID
104036877
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
158 KB
Volume
423
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds for A(n,4) and A(n,6) deriv
Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound
✍ C. Roos; C. de Vroedt 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 878 KB

An appropriate version of the linear programming bound of Delsarte for binary codes is used to find explicit upper bounds for A(n, d), with d ~(4.6). These bounds are expected to be at least as good as tAe linear programming bound of Delsarte itself. It is re-established that the Preparata codes are

Lower bound limit analysis using non-lin
Lower bound limit analysis using non-linear programming
✍ A. V. Lyamin; S. W. Sloan 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 327 KB

## Abstract This paper describes a new formulation, based on linear finite elements and non‐linear programming, for computing rigorous lower bounds in 1, 2 and 3 dimensions. The resulting optimization problem is typically very large and highly sparse and is solved using a fast quasi‐Newton method w