Abstract :
It is well known that two-weight codes result in strongly regular graphs if the code is projective. In this paper optimal (84,6,54) and (98,6,63) quasi-cyclic two-weight codes over GF(3) are presented. These codes were constructed using heuristic optimization with a local search, a technique which has been successfully employed to obtain many optimal codes. Based upon the code parameters, the existence of two strongly regular graphs is established.
