Optimal self-orthogonal binary linear codes

Titelangaben

Kurz, Sascha:
Optimal self-orthogonal binary linear codes.
Bayreuth , 2026 . - 39 S.

Volltext

	Format: PDF Name: self_orthogonal.pdf Version: Veröffentlichte Version Verfügbar mit der Lizenz Creative Commons BY 4.0: Namensnennung
	Download (283kB)

Abstract

We complete the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with given minimum distance. For dimension nine we give exact values and bounds for minimum distance at most 64. By exploiting the geometric reformulation of linear codes as multisets of points, we fully redo the classification for dimension at most seven in a simplified and computer-free manner. As a by-product we prove the non-existence of [93,9,44]_2 codes and show several divisibility results for putative optimal nine-dimensional binary codes.