On linear equivalence and Phelps codes. Addendum

Olof Heden; Martin Hessler

doi:10.3934/amc.2011.5.543

Article Contents

2011, Volume 5, Issue 3: 543-546. Doi: 10.3934/amc.2011.5.543

This issue Previous Article Optimal batch codes: Many items or low retrieval requirement Next Article Results of the enumeration of Costas arrays of order 29

On linear equivalence and Phelps codes. Addendum

Olof Heden^1, and
Martin Hessler^2,

1.
Department of Mathematics, KTH, S-100 44 Stockholm
2.
Åbylundsgatan 46, S-582 36 Linköping

Received: January 2011

Revised: May 2011

Published: August 2011

Abstract / Introduction Related Papers Cited by

Abstract

A new class of perfect 1-error correcting binary codes, so called RRH-codes, are identified, and it is shown that every such code is linearly equivalent to a perfect code obtainable by the Phelps construction.

Keywords:

Mathematics Subject Classification: Primary: 94B25.

Citation:

Related Papers

Cited by

References

[1]	O. Heden and M. Hessler, On linear equivalence and Phelps codes, Adv. Math. Commun., 4 (2010), 69-81.doi: 10.3934/amc.2010.4.69.
[2]	M. Hessler, Perfect codes as isomorphic spaces, Discr. Math., 306 (2006), 1981-1987.doi: 10.1016/j.disc.2006.03.039.