All s-sum sets of type 2 or 3 are triple-sum sets
DOI10.1016/0898-1221(92)90078-VzbMATH Open0759.94013OpenAlexW2084636051MaRDI QIDQ1193129FDOQ1193129
Authors: Josep Rifà 
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
Recommendations
- Triples which are \(D(n)\)-sets for several \(n\)'s
- On the number of sum-free triplets of sets
- scientific article; zbMATH DE number 1885976
- Sets of type \((q+2,n)\) in \(\mathrm{PG}(3, q)\)
- A note on triangulations of sumsets
- A multiple set version of the \(3k-3\) theorem
- Complete classification of 3-multisets up to combinatorial equivalence
- On the triplet-divisions of the set \(\{1,2,3,\cdots,p-2\}\)
- Sum-free subsets of finite abelian groups of type III
- Sets of type \((q+1,n)\) in \(\mathrm{PG}(3,q)\)
completely regular codedifference setsGolay code\(s\)-sum-setserror-correcting capabilityorthogonal code
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25)
Cites Work
- The Geometry of Two-Weight Codes
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: All \(s\)-sum sets of type 2 or 3 are triple-sum sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193129)
