Weight enumeration of codes from finite spaces
Combinatorics
2017-10-24 v1 Information Theory
math.IT
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
Cite
@article{arxiv.1104.0172,
title = {Weight enumeration of codes from finite spaces},
author = {Relinde Jurrius},
journal= {arXiv preprint arXiv:1104.0172},
year = {2017}
}
Comments
10 pages