Olli Pottonen

activity

20082014

most citedThe Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification

37 citations · 101 across the 7 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

cs.CC2011

Complexity of Metric Dimension on Planar Graphs

Josep Diaz, Olli Pottonen, Maria Serna +1

The metric dimension of a graph $G$ is the size of a smallest subset $L \subseteq V (G)$ such that for any $x, y \in V (G)$ with $x \neq = y$ there is a $z \in L$ such that the graph di…

cs.IT2011★ 10 cited

On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m} - 4$ and $2^{m} - 3$

Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen

Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^{m} - 4$ and $2^{m} - 3$ , respectively) ar…

Complexity of Metric Dimension on Planar Graphs

On Optimal Binary One-Error-Correcting Codes of Lengths 2m−4 and 2m−3

On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m} - 4$ and $2^{m} - 3$