Pages that link to "Item:Q5531556"

The following pages link to A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes (Q5531556):

Displaying 24 items.

• On extendability of additive code isometries (Q259263) (← links)
• Binary codes of the symplectic generalized quadrangle of even order (Q264137) (← links)
• Minimum size blocking sets of certain line sets related to a conic in \(\mathrm{PG}(2, q)\) (Q267189) (← links)
• On the extendability of quasidivisible Griesmer arcs (Q281312) (← links)
• A geometric version of the Andrásfai-Erdős-Sós theorem (Q404285) (← links)
• Extension theorems for linear codes over finite fields (Q408950) (← links)
• On \(q\)-analogues and stability theorems (Q408961) (← links)
• An extension theorem for arcs and linear codes (Q415687) (← links)
• Large weight code words in projective space codes (Q426076) (← links)
• A Hamada type characterization of the classical geometric designs (Q438902) (← links)
• Small maximal partial \(t\)-spreads in \(\mathrm{PG}(2t+1 , q)\) (Q482121) (← links)
• On the \(l\)-extendability of quaternary linear codes (Q492004) (← links)
• An analogue of the Erdős-Stone theorem for finite geometries (Q520023) (← links)
• Small point sets of \(\text{PG}(n,p^{3h})\) intersecting each line in 1 mod \(p^{h}\) points (Q622545) (← links)
• Nonbinary quantum codes derived from finite geometries (Q661977) (← links)
• Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants (Q696806) (← links)
• Curious characterizations of projective and affine geometries (Q696819) (← links)
• The characterisation of the smallest two fold blocking sets in PG\((n, 2)\) (Q766239) (← links)
• Small weight codewords in the dual code of points and hyperplanes in PG\((n, q), q\) even (Q766247) (← links)
• On Hermitian varieties in PG(6, q^2) (Q5013342) (← links)
• A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type (Q6077981) (← links)
• Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) (Q6112225) (← links)
• On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
• (Q6159867) (← links)