Skip to main content

3 Result(s)

within A. De Wispelaere Remove this filter Computer Science Remove this filter

and

  1. No Access

    Article

    Codes from Generalized Hexagons

    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)...

    A. De Wispelaere, H. Van Maldeghem in Designs, Codes and Cryptography (2005)

  2. No Access

    Article

    Regular partitions of (weak) finite generalized polygons

    In this paper we define a regular m-partition of a distance regular graph as a partition of the vertex set into m classes, such that the number of vertices of a given class adjacent to a fixed vertex of another c...

    A. De Wispelaere, H. Van Maldeghem in Designs, Codes and Cryptography (2008)

  3. No Access

    Article

    A characterization of the Grassmann embedding of H(q), with q even

    In this note, we characterize the Grassmann embedding of H(q), q even, as the unique full embedding of H(q) in PG(12, q) for which each ideal line of H(q) is contained in a plane. In particular, we show that no s...

    A. De Wispelaere, J. A. Thas, H. Van Maldeghem in Designs, Codes and Cryptography (2010)