Weight enumeration of codes from finite spaces

Authors:
Relinde P. Jurrius
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB
Venue:
Designs, Codes and Cryptography
Year:
2012

Citing 8
Cited 1

Designs and their codes

Designs and their codes
On the Reed-Muller codes

Discrete Mathematics - A collection of contributions in honour of Jack van Lint
Support weight distribution of linear codes

Discrete Mathematics - A collection of contributions in honour of Jack van Lint
Linear Perfect Codes and a Characterization of the ClassicalDesigns

Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Algebraic-Geometric Codes

Algebraic-Geometric Codes
Tutte Polynomials of Perfect Matroid Designs

Combinatorics, Probability and Computing
Geometric approach to higher weights

IEEE Transactions on Information Theory - Part 1
Generalized Hamming weights of q-ary Reed-Muller codes

IEEE Transactions on Information Theory

A Hamada type characterization of the classical geometric designs

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.