The Automorphism Groups of the Kerdock Codes

DOI10.1080/02522667.1991.10699078zbMath0749.94022OpenAlexW2088827025MaRDI QIDQ4009154

Claude Carlet

Publication date: 27 September 1992

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1991.10699078

zbMATH Keywords

permutationsautomorphism grouptranslationsfieldKerdock code

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (3)

A construction of binary linear codes from Boolean functions ⋮ Binary linear codes from vectorial Boolean functions and their weight distribution ⋮ The automorphism groups of the Delsarte-Goethals codes

Cites Work

• Unnamed Item
• Unnamed Item
• A class of low-rate nonlinear binary codes
• An exponential number of generalized Kerdock codes
• On the Preparata and Goethals codes
• On the inequivalence of generalized Preparata codes
• Spreads, Translation Planes and Kerdock Sets. I
• A class of optimum nonlinear double-error-correcting codes
• Coding theory and the Mathieu groups

This page was built for publication: The Automorphism Groups of the Kerdock Codes