#TITLE_ALTERNATIVE#
Binary linear code can be defined by constructing generator matrix from adjacency <br /> <br /> <br /> <br /> <br /> matrix of undirected graphs. A binary linier code which is constructed by a high <br /> <br /> <br /> <br /> <br /...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/14409 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Binary linear code can be defined by constructing generator matrix from adjacency <br />
<br />
<br />
<br />
<br />
matrix of undirected graphs. A binary linier code which is constructed by a high <br />
<br />
<br />
<br />
<br />
dimensional adjacency matrix of undirected graf will always accomplish Gilbert- <br />
<br />
<br />
<br />
<br />
Varshamov bound. It is well-known that from strongly regular graphs we can ob- <br />
<br />
<br />
<br />
<br />
tain nearly optimal and optimal codes. Moreover, strongly regular graphs can be <br />
<br />
<br />
<br />
<br />
operated to get a new graph and, as a by-product, a new code. In this final project, <br />
<br />
<br />
<br />
<br />
we observe four kind of operations on graph theory: union, join, product, and line <br />
<br />
<br />
<br />
<br />
graph. By using line graph operation, we get several codes which are nearly optimal <br />
<br />
<br />
<br />
<br />
and optimal. |
|---|