A general case of formal duality between binary nonlinear codes

DOI10.1016/0012-365X(93)90143-HzbMATH Open0780.94008OpenAlexW2009161098MaRDI QIDQ686446FDOQ686446

Authors: 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

Recommendations

• A simple proof of the formal duality of the Kerdock and Preparata codes
• On Z/sub 4/-duality
• Publication:4892494
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• scientific article; zbMATH DE number 503182

zbMATH Keywords

weight enumeratorbinary codeKerdock codesPreparata codes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A class of low-rate nonlinear binary codes
• Title not available (Why is that?)
• On the Preparata and Goethals codes
• A class of optimum nonlinear double-error-correcting codes
• On the inequivalence of generalized Preparata codes
• Title not available (Why is that?)
• Nonlinear codes defined by quadratic forms over GF(2)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• A simple proof of the formal duality of the Kerdock and Preparata codes
• Title not available (Why is that?)
• Properties of dual codes defined by nondegenerate forms
• A Relation Between the Characteristic Generators of a Linear Code and its Dual

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686446)