### Abstract

Original language | English |
---|---|

Title of host publication | Information Security, Coding Theory and Related Combinatorics |

Subtitle of host publication | Information coding and combinatories |

Editors | D. Crnkovic, V. Tonchev |

Place of Publication | Amsterdam |

Publisher | IOS Press |

Pages | 253-277 |

Number of pages | 460 |

ISBN (Print) | 9781607506638 |

Publication status | Published - 2011 |

### Publication series

Name | NATO Science for Peace and Security Series - D: Information and Communication Security |
---|---|

Number | 29 |

### Fingerprint

### Cite this

*Information Security, Coding Theory and Related Combinatorics: Information coding and combinatories*(pp. 253-277). (NATO Science for Peace and Security Series - D: Information and Communication Security; No. 29). Amsterdam: IOS Press.

}

*Information Security, Coding Theory and Related Combinatorics: Information coding and combinatories.*NATO Science for Peace and Security Series - D: Information and Communication Security, no. 29, IOS Press, Amsterdam, pp. 253-277.

**Matrices for graphs designs and codes.** / Haemers, W.H.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific › peer-review

TY - CHAP

T1 - Matrices for graphs designs and codes

AU - Haemers, W.H.

N1 - Pagination: 460

PY - 2011

Y1 - 2011

N2 - The adjacency matrix of a graph can be interpreted as the incidence matrix of a design, or as the generator matrix of a binary code. Here these relations play a central role. We consider graphs for which the corresponding design is a (symmetric) block design or (group) divisible design. Such graphs are strongly regular (in case of a block design) or very similar to a strongly regular graph (in case of a divisible design). Many constructions and properties for these kind of graphs are obtained. We also consider the binary code of a strongly regular graph, work out some theory and give several examples.

AB - The adjacency matrix of a graph can be interpreted as the incidence matrix of a design, or as the generator matrix of a binary code. Here these relations play a central role. We consider graphs for which the corresponding design is a (symmetric) block design or (group) divisible design. Such graphs are strongly regular (in case of a block design) or very similar to a strongly regular graph (in case of a divisible design). Many constructions and properties for these kind of graphs are obtained. We also consider the binary code of a strongly regular graph, work out some theory and give several examples.

M3 - Chapter

SN - 9781607506638

T3 - NATO Science for Peace and Security Series - D: Information and Communication Security

SP - 253

EP - 277

BT - Information Security, Coding Theory and Related Combinatorics

A2 - Crnkovic, D.

A2 - Tonchev, V.

PB - IOS Press

CY - Amsterdam

ER -