Open AccessSelf-orthogonal codes from equitable partitions of distance-regular graphs
Author(s) -
Sanja Rukavina,
Dean Crnković,
Andrea Švob
Publication year - 2024
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2022014
Subject(s) - mathematics , combinatorics , graph , strongly regular graph , discrete mathematics , line graph , graph power
We give two methods for a construction of self-orthogonal linear codes from equitable partitions of distance-regular graphs. By applying these methods, we construct self-orthogonal codes from equitable partitions of the graph of unitals in \begin{document}$ PG(2,4) $\end{document} and the only known strongly regular graph with parameters \begin{document}$ (216,40,4,8) $\end{document} . Some of the codes obtained are optimal.