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
β¦ 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
Two-weight ternary codes and the equatio
β
A. Bremner; R. Calderbank; P. Hanlon; P. Morton; J. Wolfskill
π
Article
π
1983
π
Elsevier Science
π
English
β 908 KB
On the optimal strongly connected orient
β
Fred S. Roberts; Yonghau Xu
π
Article
π
1989
π
John Wiley and Sons
π
English
β 503 KB
Some properties and applications of Herm
β
I.M Chakravarti
π
Article
π
1971
π
Elsevier Science
π
English
β 868 KB