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.

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

• scientific article; zbMATH DE number 4037764 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Geometric approach to higher weights
• Linear perfect codes and a characterization of the classical designs
• On the Reed-Muller codes
• Support weight distribution of linear codes
• The Geometry of Two-Weight Codes
• The effective length of subcodes
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-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

(17)

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

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)