✦ LIBER ✦

Binary Codes of Strongly Regular Graphs

✍ Scribed by Willem H. Haemers; René Peeters; Jeroen M. van Rijckevorsel

Book ID: 111562678
Publisher: Springer
Year: 1999
Tongue: English
Weight: 115 KB
Volume: 17
Category: Article
ISSN: 0925-1022
DOI: 10.1023/a:1026479210284

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binary codes of some strongly regular su

Binary codes of some strongly regular subgraphs of the McLaughlin graph

✍ Dimitri Leemans, B. G. Rodrigues 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 217 KB

Some new two-weight codes and strongly r

Some new two-weight codes and strongly regular graphs

✍ A.E. Brouwer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Random strongly regular graphs?

✍ Peter J. Cameron 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36; 10; 4; 2), but there are 32548 non-isomorphic graphs with parameters (36; 15; 6; 6). (The ÿrst assertion is a special case of a theorem of Sh

Random strongly regular graphs?

✍ Peter J. Cameron 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 203 KB

A new two-weight code and strongly regul

A new two-weight code and strongly regular graph

✍ T.A. Gulliver 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 209 KB

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