𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Optimum of Delsarte's Linear Program

✍ Scribed by Alex Samorodnitsky

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
200 KB
Volume
96
Category
Article
ISSN
0097-3165

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

Application of non-linear programming to
Application of non-linear programming to the optimum design of structures by using digital computers
✍ Zdzislaw K. LesΜ€niak πŸ“‚ Article πŸ“… 1965 πŸ› Elsevier Science βš– 323 KB

The paper presents the possibilities to apply a certain method of non-linear programming to the optimum design of structures with the use of digital computers. On two examples of beams the way to formulate this problem is given and the outline of its solution with the use of digital computer is show