2019/03/05 by Dean Crnković, Crnkovic, Dean, Sanja Rukavina +3 · 1 citation
Computer Science · Engineering · Medicine · #05E18 #05E30 #94B05 #94B60 #Cancer Mechanisms and Therapy #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1903.01832
openalex publication_date 2019/03/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal. Further, we introduce a notion of self-orthogonal subspace codes. We show that under some conditions equitable partitions of association schemes yield such self-orthogonal subspace codes and we give some examples from distance-regular graphs.