On a construction of self-orthogonal codes from orbit matrices of 2-designs
In 2003, Harada and Tonchev presented a construction of self-orthogonal codes from orbit matrices of symmetric $2$-designs with fixed point free automorphisms. Since then, the constructions of self-orthogonal codes from orbit matrices of $2$-designs has been extensively studied. In this paper, we present new constructions of self-orthogonal codes from orbit matrices of $2$-designs for the cases not covered by the previously described methods. We construct self-orthogonal codes from orbit matrices of $2$-$(1024,496,249)$ and $2$-$(45,5,1)$ designs. Some of the constructed codes are optimal.
Authors
- Sanja Rukavina (ORCID: https://orcid.org/0000-0003-3365-7925)
- Marija Maksimović (ORCID: https://orcid.org/0000-0002-8094-3724)
Institutions
- University of Rijeka (HR)
Publication Details
- Journal
- Contributions to Discrete Mathematics
- Published
- 2025-10-28
- DOI
- https://doi.org/10.55016/ojs/cdm.v20i2.76082
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00