#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:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/16934 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:16934 |
|---|---|
| spelling |
id-itb.:169342017-09-27T11:43:09Z#TITLE_ALTERNATIVE# RACHMANIAR (NIM : 10107053); Dosen pembimbing : Dr. Djoko Suprijanto, RANNY Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/16934 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. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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. |
| format |
Final Project |
| author |
RACHMANIAR (NIM : 10107053); Dosen pembimbing : Dr. Djoko Suprijanto, RANNY |
| spellingShingle |
RACHMANIAR (NIM : 10107053); Dosen pembimbing : Dr. Djoko Suprijanto, RANNY #TITLE_ALTERNATIVE# |
| author_facet |
RACHMANIAR (NIM : 10107053); Dosen pembimbing : Dr. Djoko Suprijanto, RANNY |
| author_sort |
RACHMANIAR (NIM : 10107053); Dosen pembimbing : Dr. Djoko Suprijanto, RANNY |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/16934 |
| _version_ |
1820745493199716352 |