New code equivalence based on relative generalized Hamming weights
Information Sciences: an International Journal
European Journal of Combinatorics
Finite Fields and Their Applications
On the floor and the ceiling of a divisor
Finite Fields and Their Applications
Evaluation codes from order domain theory
Finite Fields and Their Applications
Hyperplane Sections of Grassmannians and the Number of MDS Linear Codes
Finite Fields and Their Applications
On the Generalized Weights of a Class of Trace Codes
Finite Fields and Their Applications
SC: Secant Spaces and Clifford's Theorem over Finite Fields
Finite Fields and Their Applications
Further results on the semilinear equivalence of linear codes
Information Sciences: an International Journal
Moments of the support weight distribution of linear codes
Designs, Codes and Cryptography
Code constructions and existence bounds for relative generalized Hamming weight
Designs, Codes and Cryptography
Priority Based Error Correction Code (ECC) for the Embedded SRAM Memories in H.264 System
Journal of Signal Processing Systems
New Codes with Finite Length for a Wiretap Channel
Wireless Personal Communications: An International Journal
| Hi-index | 754.84 |
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