Codes from Generalized Hexagons

  title={Codes from Generalized Hexagons},
  author={A. De Wispelaere and Hendrik Van Maldeghem},
  journal={Designs, Codes and Cryptography},
In this paper, we construct some codes that arise from generalized hexagons with small parameters. As our main result we discover two new projective two-weight codes constructed from two-character sets in PG(5,4) and PG(11,2). These in turn are constructed using a new distance-2-ovoid of the classical generalized hexagon H(4). Also the corresponding strongly regular graph is new. The two-character set is the union of two orbits in PG(5,4) under the action of L2(13). 
On the Hall-Janko graph with 100 vertices and the near-octagon of order (2, 4)
In this paper, we construct the Hall-Janko graph inside the split Cayley hexagon H(4). Using this construction, we then embed the near-octagon of order (2,4) as a subgeometry of the dual of H(4),
Ovoids and spreads of finite classical generalized hexagons and applications
One intuitively describes a generalized hexagon as a point-line geometry full of ordinary hexagons, but containing no ordinary n-gons for n<6. A generalized hexagon has order (s,t) if every point is
Some two-character sets
Some new examples of two-character sets with respect to planes of PG(3, q2), q odd, are constructed. They arise from three-dimensional hyperbolic quadrics, from the geometry of an orthogonal polarity
On generalized hexagons of order (3, t) and (4, t) containing a subhexagon
The geometry of some two-character sets
A projective (n, d, w1, w2)q set (or a two-character set for short) is a set $${\mathcal{S}}$$ of n points of PG(d − 1, q) with the properties that the set generates PG(d − 1, q) and that every
Embeddings of Un(q2) and symmetric strongly regular graphs
In the geometric setting of the embedding of the unitary group Un(q2) inside an orthogonal or a symplectic group over the subfield GF(q) of GF(q2), q odd, we show the existence of infinite families
Regular partitions of (weak) finite generalized polygons
A structural investigation on the substructures of finite generalized polygons and unifying, alternative and more elegant proofs of the results in Offer are given.
Three-qubit operators, the split Cayley hexagon of order two, and black holes
The set of 63 real generalized Pauli matrices of three-qubits can be factored into two subsets of 35 symmetric and 28 antisymmetric elements. This splitting is shown to be completely embodied in the


Geometric hyperplanes in generalized hexagons of order (2,2)
We present a detailed study of the geometric hyperplanes of the two generalized hexagons of order (2,2). This leads to concrete descriptions of th universal embeddings of these hexagons, as well as a
A Distance-2-Spread of the Generalized Hexagon H(3)
AbstractIn this paper, we construct a distance-2-spread of the known generalized hexagon of order 3 (the split Cayley hexagon H(3)). Furthermore we prove the uniqueness of this distance-2-spread in
Some Constructions of Small Generalized Polygons
We present several new constructions for small generalized polygons using small projective planes together with a conic or a unital, using other small polygons, and using certain graphs such as the
Centering small generalized polygons-projective pottery at work
Weights of linear codes and strongly regular normed spaces
The Geometry of Two‐Weight Codes
On etudie les relations entre les codes [n,k] lineaires a deux poids, les ensembles (n,k,h 1 h 2 ) projectifs et certains graphes fortement reguliers
Generalized Polygons, Birkäuser
  • 1998
Groups and Generalized Polygons (Algebraic Combinatorics)
Sur la trialité et certains groupes qui s’en déduisent