Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for d/sub min/ (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived.
展开▼
机译：结合Delsarte（1973）的线性规划与无法发生某些权重的信息，d / sub min /（n，k）的新上限，给定字长n和维数k的二进制线性代码的最大可能最小距离，是派生的。
展开▼
