On certain blocking sets and the minimum weight of the code of generalised polygons

TL;DR

This paper investigates specific blocking sets in generalized polygons to determine the minimum weight of associated codes, providing new insights into their structure and properties.

Contribution

It introduces new characterizations of blocking sets in generalized polygons and derives results on the minimum weight of codes from their incidence matrices.

Findings

New bounds on minimum weight of codes

Characterization of blocking sets in generalized polygons

Enhanced understanding of code structure

Abstract

In this paper, we study and characterise certain blocking sets in generalised polygons. This will allow us to derive new results about the minimum weight and minimum weight code words in the code generated by the rows of the incidence matrix of a generalised polygon over a field F.