13 citations · 26 across the 15 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★ 4 cited
Construction of Z4-linear Reed-Muller codes
J. Pujol, J. Rifá, F. I. Solov'eva
New quaternary Plotkin constructions are given and are used to obtain new families of quaternary codes. The parameters of the obtained codes, such as the length, the dimension and…