A simple proof to the minimum distance of \(\mathbb{Z}_{4}\)-linear Goethals-like codes

DOI10.1016/J.JCO.2003.08.024zbMath1045.94019OpenAlexW2024780568MaRDI QIDQ1827570

Jyrki Lahtonen, Kalle Ranto, Tor Helleseth

Publication date: 6 August 2004

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2003.08.024

zbMATH Keywords

Lee metricZ\(_4\)-linear codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (1)

3-designs from all \(\mathbb Z_{4}\)-Goethals-like codes with block size 7 and 8

Cites Work

• Codes with the same weight distributions as the Goethals codes and the Delsarte-Goethals codes
• An Assmus-Mattson-type approach for identifying 3-designs from linear codes over \(\mathbb{Z}_4\)
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple proof to the minimum distance of \(\mathbb{Z}_{4}\)-linear Goethals-like codes