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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On a construction of self-orthogonal codes from orbit matrices of 2-designs

Sanja Rukavina, Marija Maksimović
Contributions to Discrete Mathematics
graph theory and CDMA systems
article

On a construction of self-orthogonal codes from orbit matrices of 2-designs

Sanja Rukavina, Marija Maksimović
article en

Abstract

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.

Contributions to Discrete MathematicsVol. 20(2)
University of Rijeka (HR)
Openalex Percentile: Top 69%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.