More on Incorrigible Sets of Binary Linear Codes
Lingjun Kong, Haiyang LIU, Lianrong Ma · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2022
This letter is concerned with incorrigible sets of binary linear codes. For a given binary linear code C, we represent the numbers of incorrigible sets of size up to ⌈3/2d - 1⌉ using the weight enumerator of C, where d is the minimum distance of C. In addition, we determine the incorrigible set enumerators of binary Golay codes G23 and G24 through combinatorial methods.