Generalized Hamming weights of codes on multi-dimensional quadrics
Generalized Hamming weights were first introduced by \textit{V. K. Wei} [IEEE Trans. Inf. Theory 37, 1412--1418 (1991; Zbl 0735.94008)] as a way of measuring an adversaries equivocation when using the cosets of a block code to send secret messages over a wire-tap channel of type II. Since then, the generalized Hamming weight has been shown to be a useful measure of the codes complexity when used in conjunction with a trellis decoder [see e.g. \textit{T. Kasami}, \textit{T. Takata}, \textit{T. Fujiwara} and \textit{S. Lin}, IEEE Trans. Inf. Theory, 39, 242--245 (1993; Zbl 0765.94014)]. In this article, the authors main object of study is the class of nonsingular quadrics in projective \(n\)-space over a finite field. For this class of curves the author determines the parameters of the algebraic geometric codes they define, including their complete weight hierarchy (generalized Hamming weights). The author also shows that a certain subset of quadrics (contained in the class of hyperbolic quadrics) actually meet the generalized Griesmer bound. In the last section, the author derives formulas for the generalized spectra of the multidimensional quadric codes.
- Quadratic forms, generalized Hamming weights of codes and curves with many points
- Generalized Hamming weights of q-ary Reed-Muller codes
- Generalized Hamming Weights for Almost Affine Codes
- Generalized Hamming weights for \([n,2]\) linear codes over \(F_q\)
- On generalized Hamming weights of some linear codes
- Generalized Hamming weights and some parameterized codes
- The generalized Hamming weights of some hyperelliptic codes
- Generalized Hamming weights and equivalences of codes
- Generalized Hamming weights of linear codes
- Generalized Hamming weights of affine Cartesian codes
- On the number of solutions of polynomial systems
- The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics
- Higher weights of anticodes and the generalized Griesmer bound.
- On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
- On codes over \(\mathrm{FFN}(1,q)\)-projective varieties
- Generalizations of the Griesmer bound
- Varieties over finite fields: quantitative theory
- Generalized Hamming weights of nonlinear codes and the relation to the Z/sub 4/-linear representation
- Geometric approach to higher weights
- Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
This page was built for publication: Generalized Hamming weights of codes on multi-dimensional quadrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895474)