#TITLE_ALTERNATIVE#
Adjacency matrix of undirected graphs can define generator matrix of binary linear codes. Parity check matrix of that codes is obtained from transposing it's generator matrix. It is shown that the class of all graphs with n vertices leads to code that meet Gilbert-Varshamov bound. Some interest...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/9778 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:9778 |
|---|---|
| spelling |
id-itb.:97782017-09-27T11:43:07Z#TITLE_ALTERNATIVE# FEBRIAN RAHMAN (NIM 10104024), ADHITYA Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/9778 Adjacency matrix of undirected graphs can define generator matrix of binary linear codes. Parity check matrix of that codes is obtained from transposing it's generator matrix. It is shown that the class of all graphs with n vertices leads to code that meet Gilbert-Varshamov bound. Some interesting codes are obtainable from strongly regulars graphs, since such codes admit an efficient decoding algorithm. Another interesting codes are obtainable from incidence matrix of 2-design that constructed from specific strongly regular graph. 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 |
Adjacency matrix of undirected graphs can define generator matrix of binary linear codes. Parity check matrix of that codes is obtained from transposing it's generator matrix. It is shown that the class of all graphs with n vertices leads to code that meet Gilbert-Varshamov bound. Some interesting codes are obtainable from strongly regulars graphs, since such codes admit an efficient decoding algorithm. Another interesting codes are obtainable from incidence matrix of 2-design that constructed from specific strongly regular graph. |
| format |
Final Project |
| author |
FEBRIAN RAHMAN (NIM 10104024), ADHITYA |
| spellingShingle |
FEBRIAN RAHMAN (NIM 10104024), ADHITYA #TITLE_ALTERNATIVE# |
| author_facet |
FEBRIAN RAHMAN (NIM 10104024), ADHITYA |
| author_sort |
FEBRIAN RAHMAN (NIM 10104024), ADHITYA |
| 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/9778 |
| _version_ |
1820664793023905792 |