Galois geometries and coding theory

Galois geometries and coding theory are two research areas which have been interacting with each other for many decades. From the early examples linking linear MDS codes with arcs in finite projective spaces, linear codes meeting the Griesmer bound with minihypers, covering radius with saturating sets, links have evolved to functional codes, generalized projective Reed–Muller codes, and even further to LDPC codes, random network codes, and distributed storage. This article reviews briefly the known links, and then focuses on new links and new directions. We present new results and open problems to stimulate the research on Galois geometries, coding theory, and on their continuously developing and increasing interactions.