Paperlane

no. 6 · Monday 2 November 2026

On $t$-designs supported by self-orthogonal codes

Masaaki Harada

math.CO · 31 pp

Abstract

We study self-orthogonal $t$-$(v,k,λ)$ designs satisfying the condition that the codes generated by the designs are self-orthogonal codes whose codewords of minimum weight $k$ correspond to the blocks. A classification of such designs is given under the conditions that $t\geq \lfloor k/4\rfloor+1\geq2$ and $t \le 11$. This yields a classification of self-orthogonal codes of minimum weight $k$ whose codewords of minimum weight form a $t$-design under the same conditions.

comments
31 pages
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2610.41545 ↗