KODE LINIER DARI GRAF STRONGLY REGULAR
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 in...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/77097 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:77097 |
|---|---|
| spelling |
id-itb.:770972023-08-22T10:59:32ZKODE LINIER DARI GRAF STRONGLY REGULAR Febrian Rahman, Adhitya Indonesia Final Project Linear codes, F2, generator matrix, strongly regular graph, adja- cency matrix, 2-design, incidence matrix. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/77097 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, Adhitya |
| spellingShingle |
Febrian Rahman, Adhitya KODE LINIER DARI GRAF STRONGLY REGULAR |
| author_facet |
Febrian Rahman, Adhitya |
| author_sort |
Febrian Rahman, Adhitya |
| title |
KODE LINIER DARI GRAF STRONGLY REGULAR |
| title_short |
KODE LINIER DARI GRAF STRONGLY REGULAR |
| title_full |
KODE LINIER DARI GRAF STRONGLY REGULAR |
| title_fullStr |
KODE LINIER DARI GRAF STRONGLY REGULAR |
| title_full_unstemmed |
KODE LINIER DARI GRAF STRONGLY REGULAR |
| title_sort |
kode linier dari graf strongly regular |
| url |
https://digilib.itb.ac.id/gdl/view/77097 |
| _version_ |
1822008172549767168 |