A combinatorial problem with applications to geometry

DOI10.1016/0097-3165(71)90036-7zbMath0291.05013OpenAlexW2013933718MaRDI QIDQ1211051

S. Singh

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0097-3165(71)90036-7

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of finite geometries (05B25) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (6)

On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre ⋮ Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\) ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) ⋮ MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes ⋮ Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) ⋮ On the nonexistence of certain M.D.S. codes and projective planes

Cites Work

• Unnamed Item
• A vector-space packing problem
• Finite nets. II: Uniqueness and imbedding
• A Metrization for Power-Sets with Applications to Combinatorial Analysis
• Finite Nets, I. Numerical Invariants

This page was built for publication: A combinatorial problem with applications to geometry