All \(s\)-sum sets of type 2 or 3 are triple-sum sets

DOI10.1016/0898-1221(92)90078-VzbMath0759.94013OpenAlexW2084636051MaRDI QIDQ1193129

Josep Rifà i Coma

Publication date: 27 September 1992

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(92)90078-v

zbMATH Keywords

difference setsGolay codecompletely regular code\(s\)-sum-setserror-correcting capabilityorthogonal code

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25)

Related Items (1)

Three-weight codes over rings and strongly walk regular graphs

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 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: All \(s\)-sum sets of type 2 or 3 are triple-sum sets