August  2011, 5(3): 543-546. doi: 10.3934/amc.2011.5.543

On linear equivalence and Phelps codes. Addendum

1. 

Department of Mathematics, KTH, S-100 44 Stockholm

2. 

Åbylundsgatan 46, S-582 36 Linköping, Sweden

Received  January 2011 Revised  May 2011 Published  August 2011

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.
Citation: Olof Heden, Martin Hessler. On linear equivalence and Phelps codes. Addendum. Advances in Mathematics of Communications, 2011, 5 (3) : 543-546. doi: 10.3934/amc.2011.5.543
References:
[1]

O. Heden and M. Hessler, On linear equivalence and Phelps codes,, Adv. Math. Commun., 4 (2010), 69.  doi: 10.3934/amc.2010.4.69.  Google Scholar

[2]

M. Hessler, Perfect codes as isomorphic spaces,, Discr. Math., 306 (2006), 1981.  doi: 10.1016/j.disc.2006.03.039.  Google Scholar

show all references

References:
[1]

O. Heden and M. Hessler, On linear equivalence and Phelps codes,, Adv. Math. Commun., 4 (2010), 69.  doi: 10.3934/amc.2010.4.69.  Google Scholar

[2]

M. Hessler, Perfect codes as isomorphic spaces,, Discr. Math., 306 (2006), 1981.  doi: 10.1016/j.disc.2006.03.039.  Google Scholar

[1]

Agnaldo José Ferrari, Tatiana Miguel Rodrigues de Souza. Rotated $ A_n $-lattice codes of full diversity. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020118

2019 Impact Factor: 0.734

Metrics

  • PDF downloads (108)
  • HTML views (0)
  • Cited by (0)

Other articles
by authors

[Back to Top]