Weight enumeration of codes from finite spaces

DOI10.1007/S10623-011-9557-2MaRDI QIDQ411495zbMATH OpenOpenAlexFDO

Authors Relinde Jurrius

Publication date 4 April 2012

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://arxiv.org/abs/1104.0172

zbMATH Keywords

finite geometrylinear codeweight enumeration

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

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.

Review text

This article gives the generalized and extended weight enumerators of the \(q\)-ary simplex codes and the \(q\)-ary first-order Reed-Muller codes. The key for the computation of the generalized weight enumerator is the translation of the codes into projective systems. Thereby, the simplex codes correspond to the full point set of a projective geometry, and the Reed-Muller codes correspond to a maximal affine subgeometry. Now the generalized weights are determined by the intersection numbers of the projective system with the different projective subspaces of the ambient geometry. Having found the generalized weight enumerators in this way, the extended weight enumerators are derived.

Recommendations

• Weight enumerators of a class of linear codes
• Complete weight enumerators of a class of linear codes
• Complete weight enumerators of a class of linear codes
• Complete weight enumerators of a class of linear codes over finite fields
• Complete weight enumerators of some classes of linear codes with a few weights
• Complete weight enumerators of some linear codes and their applications
• The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\)
• Weight enumerators of self-dual codes

Cites work

• Generalized Hamming weights for linear codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Geometric approach to higher weights
• scientific article; zbMATH DE number 4037764 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• Linear perfect codes and a characterization of the classical designs
• On the Reed-Muller codes
• Support weight distribution of linear codes
• The effective length of subcodes
• The Geometry of Two-Weight Codes
• The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
• The weight distribution of linear codes over GF(q^l) having generator matrix over GF(q)
• Tutte polynomials of perfect matroid designs

Cited in

(19)

• The weight enumerator of linear codes over \(\mathrm{GF}(q^m)\) having generator matrix over \(\mathrm{GF}(q)\)
• Weight enumerators of codes derived from polynomial product algorithms
• Higher weight spectra of codes from Veronese threefolds
• The extended coset leader weight enumerator of a twisted cubic code
• Relative profiles and extended weight polynomials of almost affine codes
• Codes from symmetric polynomials
• Projective systems whose supports consist of the union of three linear subspaces
• 2^-incorrigible set distributions of some linear codes by the finite geometry
• Duality in lp-spaces.
• A generalization of Kung's theorem
• scientific article; zbMATH DE number 4125342 (Why is no real title available?)
• A Hamada type characterization of the classical geometric designs
• Shadow codes and weight enumerators
• Encoding of dklr-sequences using one weight set
• On the Complete Weight Enumerator of Reed-Solomon Codes
• Weight enumerators of Reed-Muller codes from cubic curves and their duals
• scientific article; zbMATH DE number 5054206 (Why is no real title available?)
• On the minimum number of minimal codewords
• Bounds and MacWilliams identities for codes over Artinian rings

This page was built for publication: Weight enumeration of codes from finite spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411495)