๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Obtaining Separating Hyperplanes via Linear Programming

โœ Scribed by Martin, W. C.


Book ID
114669609
Publisher
Institute of Electrical and Electronics Engineers
Year
1971
Weight
361 KB
Volume
SMC-1
Category
Article
ISSN
0018-9472

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Upper Bounds on Permutation Codes via Li
โœ H. Tarnanen ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 140 KB

An upper bound on permutation codes of length n is given. This bound is a solution of a certain linear programming problem and is based on the well-developed theory of association schemes. Several examples are presented. For instance, the 255 values of the bound for n โ‰ค 8 are tabulated. It turns out