Maximal three-independent subsets of \(\{0,1,2\}^ n\)

DOI10.1007/BF01388452zbMath0803.51016MaRDI QIDQ1329111

Peter C. Fishburn, Robert Calderbank

Publication date: 2 January 1995

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

capspacking problem\(r\)-dimensional projective geometry

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Spreads and packing problems in finite geometry (51E23) Combinatorial aspects of packing and covering (05B40)

Related Items (7)

Unnamed Item ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ The card game SET. ⋮ On complete caps in the projective geometries over \(\mathbb F_3\) ⋮ Caps on classical varieties and their projections ⋮ Caps and progression-free sets in \(\mathbb{Z}_m^n\) ⋮ Sequences in abelian groups \(G\) of odd order without zero-sum subsequences of length \(\exp(G)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Le geometrie di Galois
• On subsets of abelian groups with no 3-term arithmetic progression
• Caps and codes
• Applications of line geometry over finite fields II. The Hermitian surface
• Forme e geometrie hermitiane, con particolare riguardo al caso finito
• The Geometry of Two-Weight Codes

This page was built for publication: Maximal three-independent subsets of \(\{0,1,2\}^ n\)