P. Östergård

activity

20072021

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

13 citations · 29 across the 4 of their papers we have counts for

collaborators

Showing cs.ITShow all

2 papers · 1 filter

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_…

cs.IT2008★ 13 cited

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

Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen +1

The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A cons…