Weight enumeration of codes from finite spaces

DOI10.1007/s10623-011-9557-2zbMath1273.94417arXiv1104.0172OpenAlexW3105962553MaRDI QIDQ411495

Relinde P. M. J. Jurrius

Publication date: 4 April 2012

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

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

zbMATH Keywords

finite geometrylinear codeweight enumeration

Mathematics Subject Classification ID

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

Related Items

A generalization of Kung's theorem, On the minimum number of minimal codewords, 2ℓ-Incorrigible set distributions of some linear codes by the finite geometry, Codes from symmetric polynomials, A Hamada type characterization of the classical geometric designs, Higher weight spectra of codes from Veronese threefolds, Weight enumerators of Reed-Muller codes from cubic curves and their duals, Relative profiles and extended weight polynomials of almost affine codes

Cites Work

• Unnamed Item
• Unnamed Item
• The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)
• On the Reed-Muller codes
• Support weight distribution of linear codes
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• The effective length of subcodes
• Linear perfect codes and a characterization of the classical designs
• Tutte Polynomials of Perfect Matroid Designs
• The Geometry of Two-Weight Codes
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Geometric approach to higher weights