The packing problem for projective geometries over GF(3) with dimension greater than five

DOI10.1016/0097-3165(83)90002-XzbMath0512.51011MaRDI QIDQ1839443

Richard A. Games

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

projective geometrypacking problem(n,d) set

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Other types of codes (94B60) Combinatorial structures in finite projective spaces (51E20) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices ⋮ Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) ⋮ Optimal ternary linear codes ⋮ The packing problem for projective geometries over GF(3) with dimension greater than five ⋮ Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\) ⋮ Rank-metric lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Le geometrie di Galois
• Packing problems in Galois geometries over \(\mathrm{GF}(3)\)
• On a geometrical method of construction of maximal t-linearly independent sets
• Caps and codes
• Elementary strong maps and transversal geometries
• The packing problem for projective geometries over GF(3) with dimension greater than five
• Maximal sets of points in finite projective space, no t-linearly dependent
• On maximal \(t\)-linearly independent sets
• On a class of error correcting binary group codes
• Further results on error correcting binary group codes
• Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
• Self-Dual Codes over ${\text{GF}}( 3 )$
• Bounds for binary codes of length less than 25

This page was built for publication: The packing problem for projective geometries over GF(3) with dimension greater than five