๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some new two-weight codes and strongly regular graphs

โœ Scribed by A.E. Brouwer

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
146 KB
Volume
10
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Two new optimal ternary two-weight codes
Two new optimal ternary two-weight codes and strongly regular graphs
โœ T.Aaron Gulliver ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 424 KB

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 h

Some new strongly regular graphs
Some new strongly regular graphs
โœ A. E. Brouwer; A. V. Ivanov; M. H. Klin ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 318 KB
New families of strongly regular graphs
New families of strongly regular graphs
โœ Yury J. Ionin; Hadi Kharaghani ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 116 KB

## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. ยฉ 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208โ€“217, 2003; Published online in Wiley InterScience (www.interscience.wil

A Block Negacyclic Bush-Type Hadamard Ma
A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs
โœ 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