More on Incorrigible Sets of Binary Linear Codes

Lingjun KONG; Haiyang LIU; Lianrong MA

doi:10.1587/transfun.2022EAL2054

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Regular Section

More on Incorrigible Sets of Binary Linear Codes

Lingjun KONG, Haiyang LIU, Lianrong MA

Author information

Keywords: incorrigible set, incorrigible set enumerator, weight enumerator, binary linear codes, binary Golay codes

JOURNAL FREE ACCESS

2023 Volume E106.A Issue 5 Pages 863-867

DOI https://doi.org/10.1587/transfun.2022EAL2054

Browse “Advance online publication” version

Details

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/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 G₂₃ and G₂₄ through combinatorial methods.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!