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 $\left\lceil \frac{3}{2}d-1 \right\rceil$ 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 G₂₃ and G₂₄ through combinatorial methods.