Codes and finite geometries - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

Codes and finite geometries


We explore the connections between finite geometry and algebraic coding theory, giving a rather full account of the Reed-Muller and generalized Reed-Muller codes. Some of the results and many of the proofs are new but this is largely an expository effort that relies heavily on the work of Delsarte et al. and of Charpin. The necessary geometric background is sketched before we begin the discussion of the Reed-Muller codes and their p-ary analogues. We prove all the classical results concerning these codes and include a discussion of the group-algebra approach and prove Berman's theorem characterizing the codes as powers of the radical. Included also is a discussion of the characterization of affine-invariant cyclic codes given by Kasami, Lin and Peterson and its generalization by Delsarte. our theme throughout this work is the relationship between these codes and the codes coming from both affine and projective geometries. The final section develops the theory in the more difficult case in which the field is not of prime order, here must look at subfield subcodes - which complicates the connection with the geometric codes, which are codesover the prime subfield of the field of the geometry.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2027.pdf (3.05 Mo) Télécharger le fichier

Dates and versions

inria-00074644 , version 1 (24-05-2006)


  • HAL Id : inria-00074644 , version 1


Edwar F. Jr Assmus, Jennifer D. Key. Codes and finite geometries. [Research Report] RR-2027, INRIA. 1993. ⟨inria-00074644⟩
91 View
43 Download


Gmail Facebook Twitter LinkedIn More