On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
From MaRDI portal
Publication:5577603
DOI10.1016/S0021-9800(69)80046-3zbMath0185.24305OpenAlexW1970529671MaRDI QIDQ5577603
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80046-3
Related Items
Proof of the Kakeya set conjecture over rings of integers modulo square-free N, Kolmogorov width of discrete linear spaces: an approach to matrix rigidity, Some \(p\)-ranks related to orthogonal spaces, Linear codes and doubly transitive symmetric designs, Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture, On the classification of geometric codes by polynomial functions, Some \(p\)-ranks related to Hermitian varieties, The socle of a projective Mackey functor for a \(p\)-group, Algebraic theory of block codes detecting independent errors, Lifted projective Reed-Solomon codes, On tensor products of CSS codes, Divisible arcs, divisible codes, and the extension problem for arcs and codes, A Hamada type characterization of the classical geometric designs, Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\), Nonbinary quantum codes derived from finite geometries, Small weight codewords of projective geometric codes, The dimension of projective geometry codes, The \(k\)-orbit reconstruction and the orbit algebra, On the nullspace of arc-transitive graphs over finite fields, Somep-ranks related to a conic inPG(2,q), Some simple modules for classical groups and \(p\)-ranks of orthogonal and Hermitian geometries., On the BIB design having the minimum p-rank, Quasi-cyclic codes from a finite affine plane, \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\), Incidence matrices of finite quadratic spaces, Intertwining automorphisms in finite incidence structures, Incomplete block design codes for ultra high speed computer applications, The family of t-designs. II, Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets, Power sum polynomials and the ghosts behind them, The vulnerability of geometric sequences based on fields of odd characteristic
