#TITLE_ALTERNATIVE#
Binary linear code can be defined by constructing generator matrix from adjacency matrix of undirected graphs. A binary linier code which is constructed by a high dimensional adjacency matrix of undirected graf will always accomplish Gilbert-Varshamov bound. It is well-known that from strongly regul...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/16934 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |
| 總結: | Binary linear code can be defined by constructing generator matrix from adjacency matrix of undirected graphs. A binary linier code which is constructed by a high dimensional adjacency matrix of undirected graf will always accomplish Gilbert-Varshamov bound. It is well-known that from strongly regular graphs we can obtain nearly optimal and optimal codes. Moreover, strongly regular graphs can be operated to get a new graph and, as a by-product, a new code. In this final project, we observe four kind of operations on graph theory: union, join, product, and line graph. By using line graph operation, we get several codes which are nearly optimal and optimal. |
|---|