Rigidity theorems for partial linear spaces

DOI10.1006/JCTA.2001.3203zbMath1024.51012OpenAlexW2087413745MaRDI QIDQ5953383

S. P. Inamdar

Publication date: 11 March 2002

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

Full work available at URL: https://doi.org/10.1006/jcta.2001.3203

zbMATH Keywords

\(p\)-ary codeminimum weight of the \(p\)-ary code dual to the codepartial linear space

Mathematics Subject Classification ID

Steiner systems in finite geometry (51E10) Combinatorial aspects of finite geometries (05B25) Other finite linear geometries (51E26)

Related Items (2)

A coding theoretic approach to the uniqueness conjecture for projective planes of prime order ⋮ Projective geometric codes

Cites Work

• Unnamed Item
• Unnamed Item
• On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
• Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture
• Codes associated with generalized polygons
• The \(\mathbb{F}_p\) span of the incidence matrix of a finite projective plane
• On the BIB design having the minimum p-rank

This page was built for publication: Rigidity theorems for partial linear spaces