Answers are grounded in this paper and cite their sources.
Motivated by cryptographical applications, the algebraic structure, of linear codes from a new perspective is studied. By viewing the minimum Hamming weight as a certain minimum property of one-dimensional subcodes, a generalized notion of higher-dimensional Hamming weights is obtained. These weights characterize the code performance on the wire-tap channel of type II. Basic properties of generalized weights are derived, the values of these weights for well-known classes of codes are determined, and lower bounds on code parameters are obtained. Several open problems are also listed.>
No takes yet. Share an insight, caveat, or question.
Victor K. Wei (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: