Self-Orthogonal Codes From Row Orbit Matrices of Strongly Regular Graphs
DOI:
https://doi.org/10.5644/SJM.15.02.13Keywords:
Self-orthogonal code, strongly regular graph, block designAbstract
We show that under certain conditions submatrices of row orbit matrices of strongly regular graphs span self-orthogonal codes. In order to demonstrate this method of construction, we construct self-orthogonal ternary linear codes from orbit matrices of the strongly regular graphs with parameters (70,27,12,9). Also we construct non self-orthogonal binary linear codes from these orbit matrices. Further, we obtain strongly regular graphs and block designs from codewords of the constructed codes.
Downloads
References
E. F. Assmus Jr, J. D. Key, Designs and their Codes, Cambridge University Press, Cambridge, 1992, Cambridge Tracts in Mathematics, vol. 103 (second printing with corrections, 1993).
M. Behbahani, On strongly regular graphs, PhD thesis, Concordia University, 2009.
M. Behbahani, C. Lam, Strongly regular graphs with non-trivial automorphisms, Discrete Math. 311 (2011), 132--144.
T. Beth, D. Jungnickel, H. Lenz, Design Theory Vol. I, Cambridge University Press, Cambridge, 1999.
W. Bosma, J. Cannon, C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997) 235--265.
A. E. Brouwer, C. J. van Eijl, On the p-rank of the adjacency matrices of strongly regular graphs, J. Algebraic Combin. 1 (1992), 329--346.
A. E. Brouwer, J. H. van Lint, Strongly regular graphs and partial geometries, in: Enumeration and Design (eds. D.M. Jackson, S.A. Vanstone), Proc. Silver Jubilee Conf. on Combinatorics, Waterloo, 1982, Academic Press, Toronto, 1984, pp. 85--122.
D. Crnković, M. Maksimović, B. G. Rodrigues, S. Rukavina, Self-orthogonal codes from the strongly regular graphs on up to 40 vertices, Adv. Math. Commun. 10 (2016), 555--582.
D. Crnković, M. Maksimović, S. Rukavina, Codes from orbit matrices of strongly regular graph, Rad Hrvats. Akad. Znan. Umjet. Mat. Znan., 22 (2018), 23--38.
W. Fish, K. Kumwenda, E. Mwambene, Codes and designs from triangular graphs and their line graphs, Cent. Eur. J. Math. 9 (2011), 1411--1423.
The GAP Group, GAP -- Groups, Algorithms, and Programming, Version 4.8.10; 2018. https://www.gap-system.org
C.D. Godsil, B.D. McKay, Constructing cospectral graphs, Aequationes Math. 25 (1982), 257--268.
W. H. Haemers, R. Peeters, J. M. van Rijckevorsel, Binary codes of strongly regular graphs, Des. Codes Cryptogr. 17 (1999), 187--209.
M. Harada, V. D. Tonchev, Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms, Discrete Math. 264 (2003), 81--90.
J. D. Key, J. Moori, B. G. Rodrigues, Permutation decoding for the binary codes from triangular graphs, European J. Combin. 25 (2004), 113--123.
L. H. Soicher, The GRAPE package for GAP, Version 4.6.1, 2012, http://www.maths.qmul.ac.uk/~leonard/grape/.
V. D. Tonchev, Combinatorial Configurations: Designs, Codes, Graphs, Pitman Monographs and Surveys in Pure and Applied Mathematics 40, Wiley, New York, 1988.
