A class of codes admitting at most three nonzero dual distances

DOI10.1016/0012-365X(91)90148-UzbMath0734.94024MaRDI QIDQ811484

Bernard Courteau, André Montpetit

Publication date: 1991

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

zbMATH Keywords

partial difference setsperfect codesprojective 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

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

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