More on incorrigible sets of binary linear codes

摘要

This letter is concerned with incorrigible sets of binarylinear codes. For a given binary linear code C, we represent the numbersof incorrigible sets of size up to?(2/3) ? 1?using the weight enumerator ofC, where is the minimum distance of C. In addition, we determine theincorrigible set enumerators of binary Golay codes G_(23) and G_(24) throughcombinatorial methods.