Generalized Hamming weights of codes on multi-dimensional quadrics (Q1895474): Difference between revisions

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.