I. Introduction
The concept of generalized Hamming weights (higher weights) for linear codes over finite fields was introduced by Wei as an application in keyless cryptography [1]. He also gave the characterization of the performance of a linear code on the wiretap channel II from its weight hierarchy. The higher weight enumerators (support weight enumerators) for linear codes over finite fields were first introduced in [2] as a generalization of the Hamming weight enumerators, and many researchers have investigated the generalized Hamming weights and the higher weight enumerators for various classes of linear codes (e.g., [3]).