Binary codes of strongly regular graphs
type: Item
instance of: scholarly article
title: Binary codes of strongly regular graphs
zbMATH Open document ID: 0938.05062
DOI: 10.1023/A:1026479210284
author: Willem H. Haemers
author: René Peeters
author: Jeroen M. van Rijckevorsel
published in: Designs, Codes and Cryptography
publication date: 2000-01-24T00:00:00Z
review text: The binary code of a graph is the linear code generated by the rows of the adjacency matrix of the graph. The authors investigate, with the exception of two parameter sets, the codes from known strongly regular graphs with fewer than 45 vertices. They also consider the codes obtained when the main diagonal of the adjacency matrix is the all-one vector. For the codes, the dimension and the weight enumerator are determined using a computer and tabulated; isomorphic codes are also indicated. Several general results for codes of (various types of) strongly regular graphs are proved.
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 1392717
zbMATH Keywords: adjacency matrix
zbMATH Keywords: code of graph
zbMATH Keywords: linear code
zbMATH Keywords: rank
zbMATH Keywords: regular two-graph
zbMATH Keywords: strongly regular graph
reviewed by: Patric R. J. Östergård
MaRDI profile type: Publication
full work available at URL: a:1026479210284
OpenAlex ID: W1535329300
description: scientific article; zbMATH DE number 1392717