Designs, Codes and Cryptography

, Volume 63, Issue 3, pp 321–330

Weight enumeration of codes from finite spaces

Authors

    • Department of Mathematics and Computer ScienceEindhoven University of Technology
Open AccessArticle

DOI: 10.1007/s10623-011-9557-2

Cite this article as:
Jurrius, R.P.M.J. Des. Codes Cryptogr. (2012) 63: 321. doi:10.1007/s10623-011-9557-2

Abstract

We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a finite projective or affine space. As a result from the geometric method we use for the weight enumeration, we also completely determine the set of supports of subcodes and words in an extension code.

Keywords

Coding theory Weight enumeration Finite geometry

Mathematics Subject Classification (2000)

05B25 11T71

Copyright information

© The Author(s) 2011