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 2015Show all

3 papers · 1 filter

math.CO2015

A coloring of the square of the 8-cube with 13 colors

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

Let $χ_{k ˉ} (n)$ be the number of colors required to color the $n$ -dimensional hypercube such that no two vertices with the same color are at a distance at most $k$ . In other w…

math.CO2015

Further Results on the Classification of MDS Codes

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

A $q$ -ary maximum distance separable (MDS) code $C$ with length $n$ , dimension $k$ over an alphabet $A$ of size $q$ is a set of $q^{k}$ codewords that are elements of $\mat…

cs.IT2015

New Lower Bounds for the Shannon Capacity of Odd Cycles

K. Ashik Mathew, Patric R. J. Östergård

The Shannon capacity of a graph $G$ is defined as $c (G) = sup_{d \geq 1} (α (G^{d}))^{\frac{1}{d}},$ where $α (G)$ is the independence number of $G$ . The Shannon capacity of the cycle $C_…