37 citations · 101 across the 7 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
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…
cs.IT2008★ 37 cited
The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification
Patric R. J. Östergård, Olli Pottonen
A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5983 such inequivalent perf…