𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two new optimal ternary two-weight codes and strongly regular graphs

✍ Scribed by T.Aaron Gulliver


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
424 KB
Volume
149
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


A Block Negacyclic Bush-Type Hadamard Ma
✍ Zvonimir Janko; Hadi Kharaghani πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 84 KB

A block negacyclic Bush-type Hadamard matrix of order 36 is used in a symmetric BGW (26, 25, 24) with zero diagonal over a cyclic group of order 12 to construct a twin strongly regular graph with parameters v=936, k=375, l=m=150 whose points can be partitioned in 26 cocliques of size 36. The same Ha