A general case of formal duality between binary nonlinear codes

DOI10.1016/0012-365X(93)90143-HzbMath0780.94008OpenAlexW2009161098MaRDI QIDQ686446

Claude Carlet

Publication date: 20 December 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90143-h

zbMATH Keywords

weight enumeratorbinary codeKerdock codesPreparata codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Cites Work

• A class of low-rate nonlinear binary codes
• On the Preparata and Goethals codes
• On the inequivalence of generalized Preparata codes
• Nonlinear codes defined by quadratic forms over GF(2)
• A class of optimum nonlinear double-error-correcting codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A general case of formal duality between binary nonlinear codes