Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances (Q6995522)

This paper has two primary objectives concerning binary self-orthogonal codes. Firstly, it characterizes the existence of binary self-orthogonal codes that meet the Griesmer bound by using Solomon-Stiffler codes, binary Simplex codes, and the first order binary Reed-Muller codes. This approach reduces the problem to a finite number of cases. Secondly, a general method is developed to demonstrate the nonexistence of certain binary self-orthogonal codes by studying their residual codes. The authors prove that Belov codes of non-Solomon-Stiffler type are not self-orthogonal. The paper determines the exact value of \(d_{so}(n,7)\), which is the largest minimum distance for all binary self-orthogonal \([n, k]\) codes.