A class of codes admitting at most three nonzero dual distances

DOI10.1016/0012-365X(91)90148-UzbMATH Open0734.94024MaRDI QIDQ811484FDOQ811484

Authors: Bernard Courteau, André Montpetit 

Publication date: 1991

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

Recommendations

• On triple-sum-sets and two or three weights codes
• Perfect codes from the dual point of view. I
• scientific article; zbMATH DE number 863485
• scientific article; zbMATH DE number 3871188
• Non-BCH triple-error-correcting codes

zbMATH Keywords

perfect codespartial difference setsprojective code1-error-correcting uniformly packed codes2-error-correcting strongly uniformly packed codescodes of order 3 or order 3-star

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

• The Geometry of Two-Weight Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On triple-sum-sets and two or three weights codes
• Codes projectifs à deux ou trois poids associes aux hyperquadriques d'une géométrie finie
• Four fundamental parameters of a code and their combinatorial significance
• Title not available (Why is that?)
• On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
• Codes projectifs à deux poids, caps complets et ensembles de différences
• Partial difference sets and partially balanced weighing designs for calibration and tournaments
• Title not available (Why is that?)
• A characterization of N-weight projective codes (Corresp.)

This page was built for publication: A class of codes admitting at most three nonzero dual distances

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