13 citations · 23 across the 2 of their papers we have counts for
2 papers
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…
math.CO2007★ 10 cited
There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of
Petteri Kaski, Patric R. J. Östergård
We establish by means of a computer search that a complete graph on 14 vertices has 98,758,655,816,833,727,741,338,583,040 distinct and 1,132,835,421,602,062,347 nonisomorphic one-…