In this paper using the weight enumerators of a linear [n, k]--code, we give a theorem about minimal codewords. In this n context, we show that while 1 E C if Wmin〉 n/2 in the binary [n, k] --code C, then all of the...In this paper using the weight enumerators of a linear [n, k]--code, we give a theorem about minimal codewords. In this n context, we show that while 1 E C if Wmin〉 n/2 in the binary [n, k] --code C, then all of the nonzero codewords of C are 2 minimal. Therefore, we obtain a corollary.展开更多
文摘In this paper using the weight enumerators of a linear [n, k]--code, we give a theorem about minimal codewords. In this n context, we show that while 1 E C if Wmin〉 n/2 in the binary [n, k] --code C, then all of the nonzero codewords of C are 2 minimal. Therefore, we obtain a corollary.
