✍ Scribed by Aimo Tietäväinen
No coin nor oath required. For personal study only.
A linear programming approach is shown to yield an improvement over a bound due to Sidelnikov.
📜 SIMILAR VOLUMES
An independent set or stable set of a graph G V, E is a subset S of the Ž . vertices set V in which no two are adjacent. Let G be the number of vertices in Ž . a stable set of maximum cardinality; G is called the stability number of G. Stability numbers of a graph have been well studied, but little
Intersection sets and blocking sets play an important role in contemporary finite geometry. There are cryptographic applications depending on their construction and combinatorial properties. This paper contributes to this topic by answering the question: how many circles of an inversive plane will b
De Vroedt, C., On the maximum cardinality of binary constant weight codes with prescribed distance, Discrete Mathematics 97 (1991) 155-160. Let A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w (0 G w < [n/2]) and Hamming distance d. In this paper a method is di