PreprintCC BY 4.0arXiv
On t-designs supported by self-orthogonal codes
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≥ ⌊ k/4⌋+1≥2 and t ≤ 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.
Related
- Optimal self-orthogonal binary linear codes
- Embedding Linear Codes into Optimal Self-Orthogonal Codes Based on Constraint-Preserving Genetic Algorithms
- Three classes of few-weight self-orthogonal projective codes and their applications for LCD codes
- Further Study of p-Ary Self-Orthogonal Codes From Square Functions
- Embedding linear codes over Z4 into self-orthogonal codes
BibTeX
@misc{harada2026tdesigns,
title = {{On $t$-designs supported by self-orthogonal codes}},
author = {Masaaki Harada},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.41545},
eprint = {2610.41545},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.41545},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On t-designs supported by self-orthogonal codes
AU - Masaaki Harada
PY - 2026
DA - 2026/10/30
PB - arXiv
DO - 10.48550/arxiv.2610.41545
UR - https://arxiv.org/abs/2610.41545
AB - 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≥ ⌊ k/4⌋+1≥2 and t ≤ 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.
ER -