More on Incorrigible Sets of Binary Linear Codes

Abstract

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 2 𝑑 − 1 ⌉ using the weight enumerator of C, where 𝑑 is the minimum distance of C. In addition, we determine the incorrigible set enumerators of binary Golay codes G 23 and G 24 through combinatorial methods.