P. Östergård

activity

20072026

most citedReconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs

13 citations · 68 across the 19 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.CO2016

There is No McLaughlin Geometry

Patric R. J. Östergård, Leonard H. Soicher

We determine that there is no partial geometry $G$ with parameters $(s, t, α) = (4, 27, 2)$ . The existence of such a geometry has been a challenging open problem of interest to re…

math.CO2016

The chromatic number of the square of the 8-cube

Janne I. Kokkala, Patric R. J. Östergård

A cube-like graph is a Cayley graph for the elementary abelian group of order $2^{n}$ . In studies of the chromatic number of cube-like graphs, the $k$ th power of the $n$ -dimensional…

cs.IT2016

Constructing error-correcting binary codes using transitive permutation groups

Antti Laaksonen, Patric R. J. Östergård

Let $A_{2} (n, d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$ . In this paper we present the following new lower bounds: $A_{2} (18, 4) \geq 5632$ , $A_2(21,4…