A vector-space packing problem

DOI10.1016/0021-8693(66)90024-XzbMath0151.01602MaRDI QIDQ2525335

Yanyan Li

Publication date: 1966

Published in: Journal of Algebra (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Related Items (8)

Maximum distance separable codes and arcs in projective spaces ⋮ Algebraic theory of block codes detecting independent errors ⋮ A combinatorial problem with applications to geometry ⋮ On proper secrets, \((t,k)\)-bases and linear codes ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ Some generalizations of Rédei’s theorem ⋮ Maximal sets of points in finite projective space, no t-linearly dependent ⋮ On the nonexistence of certain M.D.S. codes and projective planes

Cites Work

• Unnamed Item
• A Metrization for Power-Sets with Applications to Combinatorial Analysis
• The Nonexistence of Certain Finite Projective Planes
• Orthogonal Arrays of Index Unity
• Orthogonal Arrays of Strength two and three

This page was built for publication: A vector-space packing problem