Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs

Abstract The enumeration of strongly regular graphs with parameters (45, 12, 3, 3) has been completed, and it is known that there are 78 non-isomorphic strongly regular (45, 12, 3, 3) graphs. A strongly regular graph with these parameters is a symmetric (45, 12, 3) design having a polarity with no absolute points. In this paper we examine the ternary codes obtained from the adjacency (resp. incidence) matrices of these graphs (resp. designs), and those of their corresponding derived and residual designs. Further, we give a generalization of a result of Harada and Tonchev on the construction of non-binary self-orthogonal codes from orbit matrices of block designs under an action of a fixed-point-free automorphism of prime order. Using the generalized result we present a complete classification of self-orthogonal ternary codes of lengths 12, 13, 14, and 15, obtained from non-fixed parts of orbit matrices of symmetric (45, 12, 3) designs admitting an automorphism of order 3. Several of the codes obtained are optimal or near optimal for the given length and dimension. We show in addition that the dual codes of the strongly regular (45, 12, 3, 3) graphs admit majority logic decoding.

[1]  Vladimir D. Tonchev,et al.  Error-correcting codes from graphs , 2002, Discret. Math..

[2]  Vladimir Cepulic.  On symmetric block designs (40, 13, 4) with automorphisms of order 5 , 1994, Discret. Math..

[3]  Edward Spence,et al.  The Strongly Regular (45, 12, 3, 3) Graphs , 2006, Electron. J. Comb..

[4]  Iliya Bouyukliev,et al.  Some new results for optimal ternary linear codes , 2002, IEEE Trans. Inf. Theory.

[5]  Bernardo Gabriel Rodrigues,et al.  Self-orthogonal designs and codes from the symplectic groups S4(3) and S4(4) , 2008, Discret. Math..

[6]  Christoph Jansen,et al.  An Atlas of Brauer Characters , 1995 .

[7]  Xavier L. Hubaut,et al.  Strongly regular graphs , 1975, Discret. Math..

[8]  Ulrich Dempwolff.  Primitive Rank 3 Groups on Symmetric Designs , 2001, Des. Codes Cryptogr..

[10]  Vladimir D. Tonchev,et al.  Self-orthogonal Codes from Symmetric Designs with Fixed-point-free Auto-morphisms , 2003, Discret. Math..

[11]  A. Brouwer,et al.  On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs , 1992 .

[12]  N. Hamada,et al.  On the $p$-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes , 1973 .

[13]  E. Lander.  Symmetric Designs: An Algebraic Approach , 1983 .

[14]  Rudolf Mathon,et al.  On 2-(45, 12, 3) designs , 1996 .

[15]  W. Bosma,et al.  HANDBOOK OF MAGMA FUNCTIONS , 2011 .

[16]  Cheryl E. Praeger.  The flag-transitive symmetric designs with 45 points, blocks of size 12, and 3 blocks on every point pair , 2007, Des. Codes Cryptogr..

[18]  Zvonimir Janko.  Coset Enumeration in Groups and Constructions of Symmetric Designs , 1992 .

[19]  Anka Golemac,et al.  Primitive symmetric designs with up to 2500 points , 2011 .

[20]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[21]  Markus Grassl,et al.  Searching for linear codes with large minimum distance , 2006 .