Nonexistence of Several Infinite Families of Binary Self-Orthogonal Codes
The existence of optimal binary self-orthogonal codes has been well characterized. In this paper, we develop general methods involving residual codes and the MacWilliams identities to prove the nonexistence of several infinite families of binary self-orthogonal codes, despite the existence of binary linear codes with the same parameters. In particular, we focus on the largest minimum distances of optimal binary self-orthogonal codes with dimension eight.
Authors
- Tor Helleseth (ORCID: https://orcid.org/0000-0003-1290-3541)
- Minjia Shi (ORCID: https://orcid.org/0000-0002-4990-6271)
- San Ling (ORCID: https://orcid.org/0000-0002-1978-3557)
- Shitao Li (ORCID: https://orcid.org/0000-0002-9716-6212)
Institutions
- Anhui University (CN)
- Nanyang Technological University (SG)
- University of Bergen (NO)
Publication Details
- Journal
- IEEE Transactions on Information Theory
- Published
- 2025-09-16
- DOI
- https://doi.org/10.1109/tit.2025.3608038
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00