Perfect codes for metrics generated by primitive 2-error-correcting binary BCH codes
E.M. Gabidulin, Juriaan Simonis · TU/e Research Portal · 1999
For any positive integer m, a metric on F/sub 2//sup 2m/ is considered which is induced by the quasi-perfect [2/sup m/-1,2/sup m/-2m-1,5] binary BCH code. Constructions of codes are given which are perfect with respect to this metric. In addition, easy decoding methods for these codes are proposed.