A vector-space packing problem

DOI10.1016/0021-8693(66)90024-XzbMATH Open0151.01602MaRDI QIDQ2525335FDOQ2525335

Authors: Yanyan Li 

Publication date: 1966

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

zbMATH Keywords

combinatorics

Cites Work

• Orthogonal Arrays of Index Unity
• Orthogonal Arrays of Strength two and three
• Title not available (Why is that?)
• The Nonexistence of Certain Finite Projective Planes
• A Metrization for Power-Sets with Applications to Combinatorial Analysis

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2525335)