Minimum weight and dimension formulas for some geometric codes
type: Item
instance of: scholarly article
title: Minimum weight and dimension formulas for some geometric codes
zbMATH Open document ID: 0940.94025
DOI: 10.1023/A:1008362706649
published in: Designs, Codes and Cryptography
publication date: 2000-01-24T00:00:00Z
review text: Geometric codes are the duals of the codes defined by the designs associated with finite geometries. The latter are generalized Reed-Muller codes but geometric codes are not, in general, and less is known about them. The principal results of the paper under review are: (1) The minimum weight of the dual of the binary code of the design of points and \(r\)-subspaces of \(PG_m(F_q)\) and that of the design of points and \(r\)-flats of \(AG_m(F_q)\) where \(q\) is even, \(1\leq r\leq m\), \(m \geq 2\), is \((q+2)q^{m-r-1}\). This is obtained using geometric constructions in the associated geometries. (2) The dimension of the dual code of a projective geometry design is a polynomial function in the dimension of the geometry.
Mathematics Subject Classification ID: 94B27
Mathematics Subject Classification ID: 51E05
zbMATH DE Number: 1392724
zbMATH Keywords: designs
zbMATH Keywords: geometric codes
zbMATH Keywords: finite geometries
author: Neil J. Calkin
author: J. D. Key
author: M. J. de Resmini
reviewed by: T. G. Berry
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1392724