The generalized Hamming weight, d/sub r/(C), of a binary linear code C is the size of the smallest support of any r-dimensional subcode of C. The parameter d/sub r/(C) determines the code's performance on the wire-tap channel of Type II. Bounds on d/sub r/(C), and in some cases exact expressions, are derived. In particular, a generalized Griesmer bound for d/sub r/(C) is presented and examples are given of codes meeting this bound with equality.
展开▼
机译：二进制线性代码C的广义汉明权重d / sub r /（C）是C的任何r维子代码的最小支持大小。参数d / sub r /（C）决定代码的性能在类型II的窃听通道上。推导d / sub r /（C）上的界，在某些情况下还导出精确的表达式。特别地，给出了针对d / sub r /（C）的广义Griesmer界，并给出了以相等的方式满足该界的代码示例。
展开▼
