A simple proof to the minimum distance of Z4-linear Goethals-like codes

  • Authors:
  • Tor Helleseth;Jyrki Lahtonen;Kalle Ranto

  • Affiliations:
  • Department of Informatics, University of Bergen, Høyteknologisenteret, N-5020 Bergen, Norway;Department of Mathematics, University of Turku, FIN-20014 Turku, Finland;Department of Mathematics, University of Turku, FIN-20014 Turku, Finland

  • Venue:
  • Journal of Complexity - Special issue on coding and cryptography
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The quaternary Goethals-like codes are a family of Z4-linear codes of length 2m, m odd, which have 222m-3m-2 codewords and minimum Lee distance 8. They are further parameterized by an integer k subject to the constraint (k, m) = 1. In this note we give a simple new proof of the fact that the minimum distance of these codes does not depend on the auxiliary parameter k.